A quantum lower bound for the query complexity of Simon's problem
Pascal KoiranVincent NesmeNatacha PortierPublished in: CoRR (2005)
Keyphrases
- query complexity
- lower bound
- concept class
- upper bound
- vc dimension
- concept classes
- membership queries
- data complexity
- learning theory
- dnf formulas
- exact learning
- objective function
- lower and upper bounds
- np hard
- upper and lower bounds
- concept learning
- efficient learning
- worst case
- optimal solution
- expressive power
- sample complexity
- inductive inference
- sample size
- equivalence queries
- database
- dnf formulae