"Hardness results for approximate hypergraph coloring."

Subhash Khot (2002)
a service of Schloss Dagstuhl - Leibniz Center for Informatics