Polynomial running times for polynomial-time oracle machines.
Akitoshi KawamuraFlorian SteinbergPublished in: CoRR (2017)
Keyphrases
- running times
- worst case
- times faster
- polynomial hierarchy
- lower bound
- statistical queries
- polynomial size
- upper bound
- dnf formulas
- np hard
- approximation algorithms
- learning machines
- constant factor approximation algorithm
- data sets
- number of queries needed
- relational databases
- database security
- database administration
- special case
- exact learning
- computational complexity
- support vector
- case study
- databases