The phase transition in 1-in-k SAT and NAE 3-SAT.
Dimitris AchlioptasArthur D. ChtcherbaGabriel IstrateCristopher MoorePublished in: SODA (2001)
Keyphrases
- phase transition
- satisfiability problem
- sat problem
- constraint satisfaction
- np complete
- stochastic local search
- randomly generated
- np complete problems
- combinatorial problems
- graph coloring
- sat instances
- random instances
- hard problems
- average degree
- random sat
- cellular automata
- boolean satisfiability
- hamiltonian cycle
- random constraint satisfaction problems
- random graphs
- davis putnam
- evolutionary algorithm
- search algorithm
- sat solvers
- metaheuristic