Phase transition for Local Search on planted SAT
Andrei A. BulatovEvgeny S. SkvortsovPublished in: CoRR (2008)
Keyphrases
- phase transition
- stochastic local search
- satisfiability problem
- sat problem
- constraint satisfaction
- propositional satisfiability
- randomly generated
- np complete
- hard problems
- search algorithm
- average degree
- graph coloring
- sat instances
- search space
- random graphs
- random instances
- np complete problems
- combinatorial problems
- genetic algorithm
- cellular automata
- search procedures
- boolean satisfiability
- simulated annealing
- random constraint satisfaction problems
- hamiltonian cycle
- random sat
- max sat
- job shop scheduling problem
- search strategies
- tabu search
- clause learning
- hill climbing
- search procedure
- sat solvers
- satisfiability testing
- optimal solution