Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs

Subhash Khot. Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings. pages 23-32, IEEE Computer Society, 2002. [doi]

Abstract

Abstract is missing.