@InProceedings{berkholz:LIPIcs.STACS.2018.11,
author = {Berkholz, Christoph},
title = {{The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {11:1--11:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.11},
URN = {urn:nbn:de:0030-drops-85279},
doi = {10.4230/LIPIcs.STACS.2018.11},
annote = {Keywords: Proof Complexity, Polynomial Calculus, Sum-of-Squares, Sherali-Adams}
}