The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem.
Harold S. ConnamacherMichael MolloyPublished in: SIAM J. Discret. Math. (2012)
Keyphrases
- constraint satisfaction problems
- np complete
- random instances
- randomly generated
- constraint satisfaction
- sat problem
- satisfiability problem
- np hard
- phase transition
- constraint programming
- computational complexity
- constraint propagation
- combinatorial problems
- non binary
- constraint networks
- reasoning problems
- temporal constraints
- constraint solving
- arc consistency
- search space
- sat encodings
- binary csps
- bounded treewidth
- conjunctive queries
- global constraints
- tractable classes
- sat instances
- computational problems
- disjunctive temporal
- forward checking
- finite domain
- constraint problems
- symmetry breaking
- cnf formula
- decomposition methods
- soft constraints
- tree decomposition
- search algorithm
- constraint graph
- partial constraint satisfaction
- scheduling problem
- heuristic search