Phase Transition for Random Quantified XOR-Formulas
Nadia CreignouHervé DaudéUwe EglyPublished in: CoRR (2011)
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
- hard problems
- graph coloring
- average degree
- sat problem
- deep structure
- hamiltonian cycle
- small world networks
- max sat
- np complete problems
- random graphs
- special case
- traveling salesman problem
- heuristic search
- cellular automata
- query language