Unique k-SAT is as Hard as k-SAT.
Subhas Kumar GhoshPublished in: Electron. Colloquium Comput. Complex. (2006)
Keyphrases
- satisfiability problem
- sat solvers
- sat problem
- boolean satisfiability
- propositional satisfiability
- sat solving
- search algorithm
- stochastic local search
- search strategies
- stochastic local search algorithms
- phase transition
- search space
- neural network
- search strategy
- constraint satisfaction
- np complete
- probabilistic planning
- variable ordering
- pseudo boolean constraints