Unions of Disjoint NP-Complete Sets.
Christian GlaßerJohn M. HitchcockAduri PavanStephen D. TraversPublished in: COCOON (2011)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- logical equivalence
- constraint satisfaction problems
- polynomial time complexity
- conjunctive queries
- data complexity
- np complete problems
- pairwise
- data mining
- pspace complete
- computational complexity
- case study
- sat problem
- set theoretic
- bounded treewidth
- data sets