Massimo Lauria, Jakob Nordström. Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. In Ryan O'Donnell, editor, 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia. Volume 79 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{LauriaN17, title = {Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases}, author = {Massimo Lauria and Jakob Nordström}, year = {2017}, doi = {10.4230/LIPIcs.CCC.2017.2}, url = {https://doi.org/10.4230/LIPIcs.CCC.2017.2}, researchr = {https://researchr.org/publication/LauriaN17}, cites = {0}, citedby = {0}, booktitle = {32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia}, editor = {Ryan O'Donnell}, volume = {79}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-95977-040-8}, }