@InProceedings{mori_et_al:LIPIcs.APPROX-RANDOM.2016.41,
author = {Mori, Ryuhei and Witmer, David},
title = {{Lower Bounds for CSP Refutation by SDP Hierarchies}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {41:1--41:30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.41},
URN = {urn:nbn:de:0030-drops-66645},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.41},
annote = {Keywords: constraint satisfaction problems, LP and SDP relaxations, average-case complexity}
}