A lower bound on the quantum query complexity of read-once functions.
Howard BarnumMichael E. SaksPublished in: J. Comput. Syst. Sci. (2004)
Keyphrases
- lower bound
- query complexity
- concept class
- upper bound
- dnf formulas
- equivalence queries
- membership queries
- vc dimension
- concept classes
- max sat
- learning theory
- data complexity
- upper and lower bounds
- read once formulas
- np hard
- statistical queries
- lower and upper bounds
- optimal solution
- exact learning
- objective function
- pac learning
- data streams
- learning algorithm
- database