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

researchr

You are not signed in
Sign in
Sign up

Subhash Khot, Rishi Saket. Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014. pages 206-215, IEEE Computer Society, 2014. [doi]

This author has not been identified. Look up 'Subhash Khot' in GoogleThis author has not been identified. Look up 'Rishi Saket' in Google

runs on WebDSL