On the hardness of solving edge matching puzzles as SAT or CSP problems.
Carlos AnsóteguiRamón BéjarCèsar FernándezCarles MateuPublished in: Constraints An Int. J. (2013)
Keyphrases
- sat encodings
- np complete
- np complete problems
- combinatorial optimization
- constraint problems
- constraint satisfaction problems
- constraint satisfaction
- solving problems
- sat solving
- random instances
- sat instances
- graph coloring
- phase transition
- crossword puzzles
- np hardness
- combinatorial problems
- randomly generated
- satisfiability problem
- sat problem
- matching algorithm
- stochastic local search algorithms
- backtracking search
- optimization problems