Sciweavers

Share
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
10 years 2 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
books