Comparing Reductions to NP-Complete Sets.
John M. HitchcockAduri PavanPublished in: Electron. Colloquium Comput. Complex. (2006)
Keyphrases
- np complete
- randomly generated
- satisfiability problem
- np hard
- constraint satisfaction problems
- logical equivalence
- integrity constraints
- polynomial time complexity
- pspace complete
- conjunctive queries
- data sets
- genetic algorithm
- constraint satisfaction
- phase transition
- computational complexity
- database systems
- data complexity
- definite clause
- machine learning
- neural network