Well-known bound for the VC-dimension made easy
From MaRDI portal
Publication:1386180
DOI10.1007/BF01270383zbMath0898.68052MaRDI QIDQ1386180
Publication date: 10 August 1998
Published in: Computational Complexity (Search for Journal in Brave)
68R05: Combinatorics in computer science
Related Items
Algebraic methods proving Sauer's bound for teaching complexity, A Sauer-Shelah-Perles lemma for sumsets, A Sauer-Shelah-Perles lemma for lattices
Cites Work