Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs.
Rishi SaketPublished in: CoRR (2013)
Keyphrases
- phase transition
- constraint satisfaction problems
- sat problem
- constraint satisfaction
- random instances
- hypertree decomposition
- np complete
- satisfiability problem
- computational complexity
- graph theory
- decomposition methods
- learning theory
- orders of magnitude
- constraint propagation
- np hard
- special case
- definite clause
- optimal solution