6,602 research outputs found
Improved Hardness of Approximating Chromatic Number
We prove that for sufficiently large K, it is NP-hard to color K-colorable
graphs with less than 2^{K^{1/3}} colors. This improves the previous result of
K versus K^{O(log K)} in Khot [14]
- …