Unions of Disjoint NP-Complete Sets.
Christian GlaßerJohn M. HitchcockAduri PavanStephen D. TraversPublished in: ACM Trans. Comput. Theory (2014)
Keyphrases
- np complete
- randomly generated
- satisfiability problem
- computational complexity
- np hard
- constraint satisfaction problems
- logical equivalence
- polynomial time complexity
- pairwise
- website
- sat problem
- special case
- relational databases
- databases
- information systems
- convex sets
- set theoretic
- pspace complete
- definite clause
- neural network