Algebraic methods proving Sauer's bound for teaching complexity
From MaRDI portal
Publication:465250
DOI10.1016/J.TCS.2014.09.024zbMATH Open1360.68529OpenAlexW2047837697MaRDI QIDQ465250FDOQ465250
Authors: Rahim Samei, Pavel Semukhin, Boting Yang, Sandra Zilles 
Publication date: 31 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.024
Recommendations
Cites Work
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- A theory of the learnable
- Well-known bound for the VC-dimension made easy
- On the complexity of teaching
- Shifting: one-inclusion mistake bounds and sample compression
- Recursive teaching dimension, VC-dimension and sample compression
- Sauer's bound for a notion of teaching complexity
- Unlabeled compression schemes for maximum classes
- Recursive teaching dimension, learning complexity, and maximum classes
- Title not available (Why is that?)
- Models of cooperative teaching and learning
- Teachability in computational learning
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
- Recursive teaching dimension, learning complexity, and maximum classes
- Sauer's bound for a notion of teaching complexity
- 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)
