A Stochastic Limit Approach to the SAT Problem.
Luigi AccardiMasanori OhyaPublished in: Open Syst. Inf. Dyn. (2004)
Keyphrases
- sat problem
- satisfiability problem
- sat solvers
- max sat
- np complete
- constraint satisfaction problems
- phase transition
- sat instances
- boolean satisfiability
- propositional satisfiability
- sat solving
- random sat instances
- randomly generated
- davis putnam
- constraint satisfaction
- maximum satisfiability
- branch and bound
- stochastic local search
- decision problems
- np hard
- branch and bound algorithm
- weighted max sat
- random sat
- optimal solution