Polynomial-Time Random Oracles and Separating Complexity Classes.
John M. HitchcockAdewale SekoniHadi ShafeiPublished in: CoRR (2018)
Keyphrases
- worst case
- computational complexity
- tractable cases
- polynomial hierarchy
- np hardness
- polynomial size
- complexity measures
- special case
- approximation algorithms
- test cases
- database
- computational cost
- genetic algorithm
- decision problems
- np hard
- bounded treewidth
- case study
- decision trees
- complexity theoretic
- neural network