Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Massimo Lauria, Jakob Nordstrom

Journal title: 32nd Computational Complexity Conference (CCC 2017)

Journal number: 79

Journal publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Published year: 2017

Published pages: 2:1--2:20

DOI identifier: 10.4230/LIPIcs.CCC.2017.2

ISBN: 978-3-95977-040-8