Comparing reductions to NP-complete sets.
John M. HitchcockAduri PavanPublished in: Inf. Comput. (2007)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- conjunctive queries
- computational complexity
- logical equivalence
- information systems
- pspace complete
- np complete problems
- polynomially solvable
- database
- efficient computation
- data structure
- expert systems
- multiscale
- data mining
- real world
- databases
- data complexity
- bounded treewidth
- computationally complex