Polynomial-Time Random Oracles and Separating Complexity Classes.
John M. HitchcockAdewale SekoniHadi ShafeiPublished in: ACM Trans. Comput. Theory (2021)
Keyphrases
- computational complexity
- worst case
- complexity measures
- np hardness
- space complexity
- tractable cases
- decision problems
- polynomial hierarchy
- test cases
- approximation algorithms
- database
- active learning
- case study
- computational cost
- efficient learning
- np hard
- bounded treewidth
- complexity bounds
- intrinsic complexity
- complexity theoretic