Skip to content

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

Subhash Khot, Rishi Saket

VenueA*FOCS
Year2014
ProceedingsFOCS

Browse the full FOCS paper archive.