A simplified NP-complete satisfiability problem.
Craig A. ToveyPublished in: Discret. Appl. Math. (1984)
Keyphrases
- satisfiability problem
- np complete
- np hard
- randomly generated
- pspace complete
- constraint satisfaction problems
- phase transition
- sat problem
- stochastic local search algorithms
- stochastic local search
- computational complexity
- polynomial time complexity
- conjunctive queries
- bounded treewidth
- sat instances
- max sat
- decision procedures
- linear programming
- conjunctive normal form
- objective function
- mazurkiewicz traces