![](/img/cover-not-exists.png)
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors
Khot, Subhash, Saket, RishiVolume:
46
Language:
english
Journal:
SIAM Journal on Computing
DOI:
10.1137/15100240X
Date:
January, 2017
File:
PDF, 434 KB
english, 2017