The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem.
Harold S. ConnamacherMichael MolloyPublished in: FOCS (2004)
Keyphrases
- constraint satisfaction problems
- random instances
- np complete
- sat problem
- constraint satisfaction
- phase transition
- constraint propagation
- reasoning problems
- constraint programming
- randomly generated
- sat encodings
- constraint solving
- symmetry breaking
- satisfiability problem
- non binary
- combinatorial problems
- arc consistency
- forward checking
- finite domain
- constraint problems
- search space
- decomposition methods
- np hard
- soft constraints
- binary csps
- computational complexity
- tractable classes
- partial constraint satisfaction
- sat instances
- constraint networks
- global constraints
- propositional logic
- tractable subclasses
- tabu search
- disjunctive constraints
- pseudo boolean optimization
- computational properties
- state space
- heuristic search
- path consistency