@InProceedings{miksa_et_al:LIPIcs.CCC.2015.467,
author = {Miksa, Mladen and Nordstr\"{o}m, Jakob},
title = {{A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {467--487},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.467},
URN = {urn:nbn:de:0030-drops-50775},
doi = {10.4230/LIPIcs.CCC.2015.467},
annote = {Keywords: proof complexity, polynomial calculus, polynomial calculus resolution, PCR, degree, size, functional pigeonhole principle, lower bound}
}