A lower bound on the quantum query complexity of read-once functions
Howard BarnumMichael E. SaksPublished in: CoRR (2002)
Keyphrases
- query processing
- lower bound
- query complexity
- concept class
- upper bound
- membership queries
- dnf formulas
- equivalence queries
- vc dimension
- database systems
- upper and lower bounds
- data complexity
- read once formulas
- optimal solution
- max sat
- worst case
- exact learning
- efficient learning
- objective function
- lower and upper bounds
- statistical queries
- learning algorithm
- uniform distribution
- concept learning
- learning theory
- model selection
- databases
- boolean functions
- query answering
- expressive power
- simulated annealing
- np hard
- data model