Algebraic methods proving Sauer's bound for teaching complexity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6791296 (Why is no real title available?)
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A theory of the learnable
- Models of cooperative teaching and learning
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the complexity of teaching
- On the density of families of sets
- Recursive teaching dimension, VC-dimension and sample compression
- Recursive teaching dimension, learning complexity, and maximum classes
- Sauer's bound for a notion of teaching complexity
- Shifting: one-inclusion mistake bounds and sample compression
- Teachability in computational learning
- Unlabeled compression schemes for maximum classes
- Well-known bound for the VC-dimension made easy
Cited in
(8)- Distinguishing pattern languages with membership examples
- Teaching and Compressing for Low VC-Dimension
- On the Teaching Complexity of Linear Sets
- A note on hardness of computing recursive teaching dimension
- Sauer's bound for a notion of teaching complexity
- Recursive teaching dimension, learning complexity, and maximum classes
- Recursive teaching dimension, VC-dimension and sample compression
- On the teaching complexity of linear sets
This page was built for publication: Algebraic methods proving Sauer's bound for teaching complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465250)
