Go to the corresponding LIPIcs Volume Portal 
Lauria, Massimo ; Nordström, Jakob
pdfformat: 

@InProceedings{lauria_et_al:LIPIcs:2017:7541, author = {Massimo Lauria and Jakob Nordstr{\"o}m}, 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:12:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770408}, ISSN = {18688969}, year = {2017}, volume = {79}, editor = {Ryan O'Donnell}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7541}, URN = {urn:nbn:de:0030drops75410}, doi = {10.4230/LIPIcs.CCC.2017.2}, annote = {Keywords: proof complexity, Nullstellensatz, Gr{\"o}bner basis, polynomial calculus, cutting planes, colouring} }
Keywords:  proof complexity, Nullstellensatz, Gröbner basis, polynomial calculus, cutting planes, colouring  
Collection:  32nd Computational Complexity Conference (CCC 2017)  
Issue Date:  2017  
Date of publication:  01.08.2017 