From Spin Glasses to Hard Satisfiable Formulas.
Haixia JiaCristopher MooreBart SelmanPublished in: SAT (2004)
Keyphrases
- truth assignment
- random sat
- phase transition
- propositional formulas
- satisfiability problem
- sat problem
- randomly chosen
- cnf formula
- random instances
- randomly generated
- np complete
- special case
- mathematical formulas
- orders of magnitude
- max sat
- illumination conditions
- hard problems
- constraint satisfaction
- boolean satisfiability
- conjunctive normal form