The Complexity of the Satisfiability Problem for Krom Formulas.
Larry DenenbergHarry R. LewisPublished in: Theor. Comput. Sci. (1984)
Keyphrases
- satisfiability problem
- pspace complete
- random sat
- np complete
- phase transition
- temporal logic
- search algorithm
- conjunctive normal form
- sat problem
- stochastic local search
- computational complexity
- stochastic local search algorithms
- model checking
- sat instances
- decision problems
- decision procedures
- objective function
- randomly generated
- max sat
- boolean formula