@InProceedings{lauria_et_al:LIPIcs.CCC.2017.2,
author = {Lauria, Massimo and Nordstr\"{o}m, Jakob},
title = {{Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gr\"{o}bner Bases}},
booktitle = {32nd Computational Complexity Conference (CCC 2017)},
pages = {2:1--2:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-040-8},
ISSN = {1868-8969},
year = {2017},
volume = {79},
editor = {O'Donnell, Ryan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.2},
URN = {urn:nbn:de:0030-drops-75410},
doi = {10.4230/LIPIcs.CCC.2017.2},
annote = {Keywords: proof complexity, Nullstellensatz, Gr\"{o}bner basis, polynomial calculus, cutting planes, colouring}
}