Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes.
Hideaki FukuharaEiji TakimotoPublished in: CATS (2009)
Keyphrases
- query complexity
- lower bound
- decision trees
- concept class
- equivalence queries
- membership queries
- dnf formulas
- vc dimension
- upper bound
- max sat
- learning theory
- concept classes
- data complexity
- exact learning
- upper and lower bounds
- efficient learning
- read once formulas
- learning algorithm
- machine learning algorithms
- uniform distribution
- machine learning
- objective function
- inductive inference
- training data
- boolean functions
- lower and upper bounds
- sample complexity
- pac learning
- target concept
- query answering
- decision lists
- sample size
- worst case
- special case
- training set
- concept learning