Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems.
Delbert D. BaileyVíctor DalmauPhokion G. KolaitisPublished in: AAAI/IAAI (2002)
Keyphrases
- phase transition
- satisfiability problem
- pspace complete
- constraint satisfaction
- np complete
- randomly generated
- sat problem
- combinatorial problems
- hard problems
- graph coloring
- max sat
- search algorithm
- temporal logic
- davis putnam
- stochastic local search
- np complete problems
- random instances
- random constraint satisfaction problems
- sat instances
- heuristic search
- random sat