Hardness of approximate hypergraph coloring

DOI10.1109/SFCS.2000.892074MaRDI QIDQ7239940zbMATH OpenFDO

Authors Venkatesan Guruswami, Johan Hastad, Madhu Sudan

Publication date 8 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.2000.892074

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: Hardness of approximate hypergraph coloring

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