Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments.
Sophie LaplanteFrédéric MagniezPublished in: SIAM J. Comput. (2008)
Keyphrases
- query complexity
- lower bound
- concept class
- vc dimension
- upper bound
- concept classes
- learning theory
- membership queries
- data complexity
- equivalence queries
- sample complexity
- dnf formulas
- upper and lower bounds
- exact learning
- lower and upper bounds
- sample size
- worst case
- efficient learning
- inductive inference
- concept learning
- np hard
- objective function
- target concept
- pac learning
- uniform distribution
- optimal solution
- dnf formulae
- first order logic
- computational complexity
- database systems