Phase Transitions of Bounded Satisfiability Problems.
Delbert D. BaileyPhokion G. KolaitisPublished in: IJCAI (2003)
Keyphrases
- phase transition
- satisfiability problem
- constraint satisfaction
- np complete
- randomly generated
- sat problem
- stochastic local search
- combinatorial problems
- random instances
- hard problems
- graph coloring
- sat instances
- np complete problems
- random constraint satisfaction problems
- temporal logic
- search algorithm
- davis putnam
- pspace complete
- bounded treewidth
- cellular automata
- conjunctive normal form
- graph coloring problems