Massimo Lauria, Jakob Nordström. Tight Size-Degree Bounds for Sums-of-Squares Proofs. In David Zuckerman, editor, 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA. Volume 33 of LIPIcs, pages 448-466, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]
@inproceedings{LauriaN15-0, title = {Tight Size-Degree Bounds for Sums-of-Squares Proofs}, author = {Massimo Lauria and Jakob Nordström}, year = {2015}, doi = {10.4230/LIPIcs.CCC.2015.448}, url = {http://dx.doi.org/10.4230/LIPIcs.CCC.2015.448}, researchr = {https://researchr.org/publication/LauriaN15-0}, cites = {0}, citedby = {0}, pages = {448-466}, booktitle = {30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA}, editor = {David Zuckerman}, volume = {33}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-939897-81-1}, }