Computational Complexity of Some Restricted Instances of 3SAT
Piotr BermanMarek KarpinskiAlexander D. ScottPublished in: Electron. Colloquium Comput. Complex. (2004)
Keyphrases
- computational complexity
- np complete
- stochastic local search
- np complete problems
- propositional satisfiability
- sat problem
- sat instances
- randomly generated
- backtracking search
- satisfiability problem
- search procedures
- sat solvers
- solving hard
- random sat instances
- phase transition
- high computational complexity
- constraint satisfaction problems
- special case
- maximum satisfiability
- decision problems
- computational cost
- np hard
- propositional logic
- low complexity
- training instances
- computationally efficient
- boolean satisfiability
- search space
- evolutionary algorithm
- stochastic local search algorithms
- variable ordering
- constraint satisfaction
- industrial applications
- search strategies