A Quantum Lower Bound for the Query Complexity of Simon's Problem.
Pascal KoiranVincent NesmeNatacha PortierPublished in: ICALP (2005)
Keyphrases
- query complexity
- lower bound
- concept class
- vc dimension
- upper bound
- membership queries
- data complexity
- concept classes
- np hard
- learning theory
- lower and upper bounds
- exact learning
- worst case
- dnf formulas
- optimal solution
- upper and lower bounds
- objective function
- uniform distribution
- equivalence queries
- sample complexity
- resource consumption
- concept learning
- boolean functions
- np complete
- database
- dnf formulae
- pac learning
- databases