Computational complexity of some restricted instances of 3-SAT.
Piotr BermanMarek KarpinskiAlexander D. ScottPublished in: Discret. Appl. Math. (2007)
Keyphrases
- computational complexity
- np complete
- sat instances
- stochastic local search
- np complete problems
- propositional satisfiability
- randomly generated
- sat problem
- satisfiability problem
- sat solvers
- low complexity
- solving hard
- search procedures
- decision problems
- search algorithm
- memory requirements
- backtracking search
- random sat instances
- np hard
- special case
- phase transition
- propositional logic
- bit rate
- computational cost
- search space
- maximum satisfiability
- stochastic local search algorithms
- training instances
- boolean satisfiability
- high computational complexity
- max sat
- computational efficiency