Login / Signup

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

Massimo LauriaJakob Nordström
Published in: Computational Complexity Conference (2017)
Keyphrases
  • graph colouring
  • numerically stable
  • computational complexity
  • lower bound
  • computational intelligence
  • multi dimensional
  • orders of magnitude
  • round robin