Witness of unsatisfiability for a random 3-satisfiability formula
Lu-lu WuHai-Jun ZhouMikko AlavaErik AurellPekka OrponenPublished in: CoRR (2013)
Keyphrases
- cnf formula
- propositional formulas
- random sat
- max sat
- np complete
- propositional logic
- satisfiability problem
- sat problem
- phase transition
- normal form
- conjunctive normal form
- stochastic local search
- boolean formula
- randomly generated
- davis putnam
- random constraint satisfaction problems
- computational complexity
- unit propagation
- random instances
- uniformly distributed
- branch and bound
- knowledge compilation
- sat solvers