Uniform Characterizations of Polynomial-Query Learnabilities
Authors:
- 1 January 1998
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 292 (2) , 84-92
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Oracles in Σ2p are sufficient for exact learning1997
- How many queries are needed to learn?Journal of the ACM, 1996
- Oracles and Queries That Are Sufficient for Exact LearningJournal of Computer and System Sciences, 1996
- On the Complexity of TeachingJournal of Computer and System Sciences, 1995
- Generalized teaching dimensions and the query complexity of learning1995