A Natural NP-Complete Problem with a Nontrivial Lower Nound.
Etienne GrandjeanPublished in: SIAM J. Comput. (1988)
Keyphrases
- np complete
- satisfiability problem
- computational complexity
- randomly generated
- np hard
- constraint satisfaction problems
- pspace complete
- polynomially solvable
- conp complete
- conjunctive queries
- data complexity
- polynomial time complexity
- database
- slightly higher
- np complete problems
- sat problem
- real world
- cnf formula
- phase transition
- computationally complex
- neural network
- databases