Properties of NP-Complete Sets
Christian GlaßerAduri PavanAlan L. SelmanSamik SenguptaPublished in: Electron. Colloquium Comput. Complex. (2004)
Keyphrases
- np complete
- logical equivalence
- randomly generated
- np hard
- desirable properties
- satisfiability problem
- polynomial time complexity
- closed sets
- structural properties
- computational complexity
- data sets
- conjunctive queries
- multi agent
- convex sets
- binary relations
- topological properties
- decision trees
- machine learning
- neural network