Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs

Rishi Saket. Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. In IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014. pages 78-89, IEEE, 2014. [doi]

Abstract

Abstract is missing.