Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT
Marco GuidettiA. P. YoungPublished in: CoRR (2011)
Keyphrases
- constraint satisfaction problems
- np hard
- search space
- worst case
- space complexity
- computational complexity
- optimal solution
- dynamic programming
- constraint satisfaction
- backtracking search
- forward checking
- np complete
- search algorithm
- integer linear programming
- path consistency
- randomly generated
- constraint propagation
- arc consistency
- combinatorial problems
- non binary
- exact algorithms
- constraint programming
- stochastic local search
- combinatorial optimization
- constraint solving
- linear programming
- lower bound