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

DOI10.1109/FOCS.2014.30MaRDI QIDQ6947241zbMATH OpenFDO

Authors Subhash Khot, Rishi Saket

Publication date 5 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2014.30

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

This page was built for publication: Hardness of coloring 2-colorable 12-uniform hypergraphs with \(2^{(\log n)^{\Omega(1)}}\) colors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6947241)