Characterizations of symmetrically partial Boolean functions with exact quantum query complexity.
Daowen QiuShenggen ZhengPublished in: CoRR (2016)
Keyphrases
- boolean functions
- query complexity
- membership queries
- dnf formulae
- uniform distribution
- exact learning
- dnf formulas
- concept class
- efficient learning
- pac learning
- target concept
- equivalence queries
- read once formulas
- concept classes
- disjunctive normal form
- learning algorithm
- data complexity
- logic circuits
- quantum computing
- machine learning
- computational learning theory