@InProceedings{kurpisz_et_al:LIPIcs.ICALP.2016.78,
author = {Kurpisz, Adam and Lepp\"{a}nen, Samuli and Mastrolilli, Monaldo},
title = {{Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems}},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages = {78:1--78:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-013-2},
ISSN = {1868-8969},
year = {2016},
volume = {55},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.78},
URN = {urn:nbn:de:0030-drops-63368},
doi = {10.4230/LIPIcs.ICALP.2016.78},
annote = {Keywords: SoS/Lasserre hierarchy, lift and project methods, binary polynomial optimization}
}