Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems
Gabriel IstratePublished in: CoRR (2005)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- search space
- constraint programming
- boolean functions
- np complete
- combinatorial problems
- arc consistency
- np hard
- non binary
- computational problems
- global constraints
- sat problem
- constraint networks
- disjunctive temporal
- constraint problems
- forward checking
- finite domain
- constraint solving
- partial constraint satisfaction
- dynamic constraint satisfaction problems
- constraint solver
- temporal constraints
- finding optimal solutions
- computational complexity
- pseudo boolean optimization