Combinatorial results on the complexity of teaching and learning
From MaRDI portal
(Redirected from Publication:5096898)
Recommendations
Cites work
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
- scientific article; zbMATH DE number 3150822 (Why is no real title available?)
- scientific article; zbMATH DE number 3693155 (Why is no real title available?)
- scientific article; zbMATH DE number 1256689 (Why is no real title available?)
- scientific article; zbMATH DE number 3110611 (Why is no real title available?)
- Lower bound methods and separation results for on-line learning models
- Queries and concept learning
- Teachability in computational learning
- Teaching a smarter learner.
Cited in
(17)- On the teaching complexity of linear sets
- On the complexity of teaching
- The teaching size: computable teachers and learners for universal languages
- Exact learning from an honest teacher that answers membership queries
- Classifying the arithmetical complexity of teaching models
- The teaching dimension of linear learners
- On the Teaching Complexity of Linear Sets
- Massive online teaching to bounded learners
- Sauer's bound for a notion of teaching complexity
- Learning Boolean halfspaces with small weights from membership queries
- Algebraic methods proving Sauer's bound for teaching complexity
- Recursive teaching dimension, learning complexity, and maximum classes
- Preference-based teaching
- Models of cooperative teaching and learning
- A note on hardness of computing recursive teaching dimension
- Teachability in computational learning
- Measuring teachability using variants of the teaching dimension
This page was built for publication: Combinatorial results on the complexity of teaching and learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096898)
