Algebraic methods proving Sauer's bound for teaching complexity
From MaRDI portal
Publication:465250
DOI10.1016/J.TCS.2014.09.024zbMath1360.68529OpenAlexW2047837697MaRDI QIDQ465250
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
Related Items (3)
Distinguishing pattern languages with membership examples ⋮ A note on hardness of computing recursive teaching dimension ⋮ Teaching and Compressing for Low VC-Dimension
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Teachability in computational learning
- Well-known bound for the VC-dimension made easy
- On the complexity of teaching
- Shifting: one-inclusion mistake bounds and sample compression
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Sauer’s Bound for a Notion of Teaching Complexity
- A theory of the learnable
- Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
This page was built for publication: Algebraic methods proving Sauer's bound for teaching complexity
