Irit Dinur, Igor Shinkar. On the Conditional Hardness of Coloring a 4-colorable Graph with Super-Constant Number of Colors. Electronic Colloquium on Computational Complexity (ECCC), 20:148, 2013. [doi]
No references recorded for this publication.
No citations of this publication recorded.