The SAT 2005 Solver Competition on Random Instances.
Oliver KullmannPublished in: J. Satisf. Boolean Model. Comput. (2006)
Keyphrases
- sat instances
- random instances
- sat solvers
- phase transition
- constraint satisfaction
- sat problem
- satisfiability problem
- randomly generated
- orders of magnitude
- propositional satisfiability
- search space
- boolean satisfiability
- search strategies
- constraint satisfaction problems
- max sat
- computational properties
- search tree
- hard problems
- clause learning
- np complete
- graph coloring