Hardness of Coloring $2$-Colorable $12$-Uniform Hypergraphs with $2^{(\log n)^{\Omega(1)}}$ Colors - researchr publication references

researchr

You are not signed in
Sign in
Sign up

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]

No references recorded for this publication.

No citations of this publication recorded.

runs on WebDSL