Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(log n)ω(1) colors

Subhash Khot, Rishi Saket

Research output: Contribution to journalArticlepeer-review

Fingerprint

Dive into the research topics of 'Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(log n)ω(1) colors'. Together they form a unique fingerprint.

Keyphrases

Mathematics