Phase Transition for Random Quantified XOR-Formulas.
Nadia CreignouHervé DaudéUwe EglyPublished in: J. Artif. Intell. Res. (2007)
Keyphrases
- phase transition
- random sat
- random instances
- random constraint satisfaction problems
- randomly generated
- constraint satisfaction
- satisfiability problem
- easy hard easy pattern
- np complete
- combinatorial problems
- sat problem
- hard problems
- average degree
- hamiltonian cycle
- graph coloring
- np complete problems
- max sat
- small world networks
- boolean satisfiability
- constraint satisfaction problems
- random graphs