From Spin Glasses to Hard Satisfiable Formulas.
Haixia JiaCristopher MooreBart SelmanPublished in: SAT (Selected Papers (2004)
Keyphrases
- random sat
- truth assignment
- phase transition
- sat problem
- satisfiability problem
- propositional formulas
- cnf formula
- np complete
- max sat
- randomly generated
- mathematical formulas
- database
- case study
- sat instances
- conjunctive normal form
- boolean satisfiability
- randomly chosen
- constraint satisfaction
- video conferencing
- propositional logic
- constraint satisfaction problems