The Hardness of 3 - Uniform Hypergraph Coloring

Irit Dinur, Oded Regev, Clifford D. Smyth. The Hardness of 3 - Uniform Hypergraph Coloring. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings. pages 33, IEEE Computer Society, 2002. [doi]

Abstract

Abstract is missing.