Weak lumpability in the k-SAT problem.
Michael GrinfeldP. A. KnightPublished in: Appl. Math. Lett. (2000)
Keyphrases
- sat problem
- satisfiability problem
- sat solvers
- constraint satisfaction problems
- np complete
- phase transition
- boolean satisfiability
- sat solving
- max sat
- sat instances
- randomly generated
- davis putnam
- propositional satisfiability
- random sat instances
- decision problems
- stochastic local search
- constraint satisfaction
- propositional formulas
- branch and bound
- search space
- weighted max sat
- maximum satisfiability
- orders of magnitude
- data structure
- objective function