Polynomially Solvable Satisfiability Problems.
Giorgio GalloMaria Grazia ScutellàPublished in: Inf. Process. Lett. (1988)
Keyphrases
- satisfiability problem
- polynomially solvable
- np complete
- np hard
- pspace complete
- randomly generated
- sat problem
- constraint satisfaction problems
- stochastic local search
- stochastic local search algorithms
- phase transition
- computational complexity
- sat instances
- special case
- solving hard
- davis putnam
- processing times
- state space
- search algorithm