Well-known bound for the VC-dimension made easy

DOI10.1007/BF01270383zbMath0898.68052MaRDI QIDQ1386180

Roman Smolensky

Publication date: 10 August 1998

Published in: Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

Vapnik-Chervonenkis dimension

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (3)

A Sauer-Shelah-Perles lemma for sumsets ⋮ A Sauer-Shelah-Perles lemma for lattices ⋮ Algebraic methods proving Sauer's bound for teaching complexity

Cites Work

• On the density of families of sets

This page was built for publication: Well-known bound for the VC-dimension made easy