Phase Transitions of PP-Complete Satisfiability Problems.
Delbert D. BaileyVíctor DalmauPhokion G. KolaitisPublished in: IJCAI (2001)
Keyphrases
- phase transition
- satisfiability problem
- pspace complete
- constraint satisfaction
- np complete
- sat problem
- hard problems
- combinatorial problems
- temporal logic
- randomly generated
- random constraint satisfaction problems
- davis putnam
- graph coloring
- sat instances
- stochastic local search
- np complete problems
- random sat
- random graphs
- cellular automata
- constraint propagation
- model checking
- random instances
- knowledge representation
- np hard