A Note on the Use of Independent Sets for the k-SAT Problem.
Konstantin KutzkovPublished in: J. Satisf. Boolean Model. Comput. (2006)
Keyphrases
- sat problem
- satisfiability problem
- np complete
- sat solvers
- constraint satisfaction problems
- max sat
- random sat instances
- phase transition
- randomly generated
- boolean satisfiability
- decision problems
- propositional formulas
- sat solving
- stochastic local search
- constraint satisfaction
- evolutionary algorithm
- propositional satisfiability
- heuristic search
- davis putnam
- np hard