Autoreducibility of NP-Complete Sets.
John M. HitchcockHadi ShafeiPublished in: Electron. Colloquium Comput. Complex. (2016)
Keyphrases
- np complete
- randomly generated
- logical equivalence
- np hard
- computational complexity
- constraint satisfaction problems
- pspace complete
- databases
- polynomial time complexity
- bounded treewidth
- conjunctive queries
- computationally complex
- conp complete
- polynomially solvable
- data complexity
- phase transition
- database
- website
- information systems
- genetic algorithm
- data sets