One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete.
Jan KratochvílPetr SavickýZsolt TuzaPublished in: SIAM J. Comput. (1993)
Keyphrases
- np complete
- satisfiability problem
- randomly generated
- np hard
- boolean formula
- pspace complete
- phase transition
- computational complexity
- sat problem
- constraint satisfaction problems
- cnf formula
- conjunctive queries
- polynomial time complexity
- markov chain
- data complexity
- np complete problems
- sat instances
- causal relationships
- constraint satisfaction
- conp complete