SAT distributions with planted assignments and phase transitions between decision and optimization problems.
Tassos DimitriouPublished in: Discret. Appl. Math. (2005)
Keyphrases
- phase transition
- optimization problems
- satisfiability problem
- sat problem
- constraint satisfaction
- evolutionary algorithm
- combinatorial problems
- randomly generated
- np complete problems
- hard problems
- objective function
- cost function
- random constraint satisfaction problems
- np complete
- stochastic local search
- probability distribution
- metaheuristic
- graph coloring
- max sat
- random graphs
- traveling salesman problem
- random sat
- sat instances
- combinatorial optimization
- random instances
- davis putnam
- boolean satisfiability
- power law
- decision problems
- cellular automata