Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems.
Yong GaoPublished in: AAAI (2008)
Keyphrases
- phase transition
- np complete
- random sat
- satisfiability problem
- combinatorial problems
- hard problems
- random instances
- np complete problems
- computational complexity
- sat problem
- constraint satisfaction
- random constraint satisfaction problems
- randomly generated
- np hard
- graph coloring
- difficult problems
- cellular automata
- sat instances
- decision problems