On the Hardness and Easiness of Random 4-SAT Formulas.
Andreas GoerdtAndré LankaPublished in: ISAAC (2004)
Keyphrases
- random sat
- phase transition
- satisfiability problem
- constraint satisfaction
- combinatorial problems
- randomly generated
- sat problem
- np complete
- random constraint satisfaction problems
- random sat instances
- random instances
- cellular automata
- graph coloring
- genetic algorithm
- constraint programming
- orders of magnitude
- constraint satisfaction problems
- linear programming
- special case