Polynomial Running Times for Polynomial-Time Oracle Machines.
Akitoshi KawamuraFlorian SteinbergPublished in: FSCD (2017)
Keyphrases
- running times
- worst case
- times faster
- polynomial hierarchy
- lower bound
- statistical queries
- upper bound
- special case
- approximation algorithms
- computational complexity
- polynomial size
- database administrators
- data sets
- oracle database
- np hard
- database
- pac learning
- learning theory
- database applications
- bounded treewidth
- turing machine
- low degree
- randomized approximation