On the satisfiability of random regular signed SAT formulas
Christian LausDirk Oliver TheisPublished in: CoRR (2011)
Keyphrases
- random sat
- satisfiability problem
- sat problem
- phase transition
- truth assignment
- cnf formula
- boolean formula
- conjunctive normal form
- propositional formulas
- np complete
- boolean satisfiability
- max sat
- sat solvers
- propositional satisfiability
- davis putnam
- random sat instances
- temporal logic
- satisfiability testing
- random instances
- sat solving
- random constraint satisfaction problems
- search algorithm
- randomly generated
- propositional logic
- constraint satisfaction
- stochastic local search
- sat instances
- constraint satisfaction problems
- randomly chosen
- stochastic local search algorithms
- sat encodings
- orders of magnitude
- np complete problems