Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Subhash Khot, Rishi Saket. Hardness of Coloring $2$-Colorable $12$-Uniform Hypergraphs with $2^{(\log n)^{\Omega(1)}}$ Colors. Electronic Colloquium on Computational Complexity (ECCC), 21:51, 2014. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) ColorsSubhash Khot, Rishi Saket. focs 2014: 206-215 [doi] Hardness Results for Coloring 3 -Colorable 3 -Uniform HypergraphsSubhash Khot. focs 2002: 23-32 [doi]
The following publications are possibly variants of this publication: