Constraint satisfaction problems with isolated solutions are hard
Lenka ZdeborováMarc MézardPublished in: CoRR (2008)
Keyphrases
- constraint satisfaction problems
- graph coloring problems
- combinatorial problems
- constraint satisfaction
- random instances
- constraint programming
- solving constraint satisfaction problems
- search space
- constraint propagation
- hyper heuristics
- backtrack search
- arc consistency
- np complete
- dynamic constraint satisfaction problems
- np hard
- finding optimal solutions
- non binary
- configuration problems
- soft constraints
- computational problems
- constraint solving
- product configuration
- benchmark problems
- partial assignment
- hard problems
- optimal solution
- constraint optimization
- scheduling problem
- temporal constraints
- constraint solver
- forward checking
- metaheuristic
- search algorithm