WELL-KNOWN BOUND FOR THE VC-DIMENSION MADE EASY

Authors
SMOLENSKY R
Citation
R. Smolensky, WELL-KNOWN BOUND FOR THE VC-DIMENSION MADE EASY, Computational complexity, 6(4), 1997, pp. 299-300
Citations number
1
Journal title
Computational complexity → ACNP
ISSN journal
10163328
Volume
6
Issue
4
Year of publication
1997
Pages
299 - 300
Database
ISI
SICI code
1016-3328(1997)6:4<299:WBFTVM>2.0.ZU;2-T
Abstract
The Sauer lemma gives an upper bound for the cardinality of a set with given Vapnik-Chervonenkis dimension (VC-dimension). This paper presen ts a simple algebraic proof.