Phase Transition for Local Search on Planted SAT.
Andrei A. BulatovEvgeny S. SkvortsovPublished in: MFCS (2) (2015)
Keyphrases
- phase transition
- stochastic local search
- satisfiability problem
- sat problem
- constraint satisfaction
- combinatorial problems
- propositional satisfiability
- randomly generated
- search algorithm
- np complete
- hard problems
- graph coloring
- average degree
- np complete problems
- search space
- random instances
- hamiltonian cycle
- boolean satisfiability
- sat instances
- memetic algorithm
- combinatorial optimization
- genetic algorithm
- search procedures
- constraint satisfaction problems
- random constraint satisfaction problems
- max sat
- simulated annealing
- davis putnam
- tabu search
- constraint programming