Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions

DOI10.1016/0304-3975(94)00164-EzbMath0873.68176MaRDI QIDQ674405

Ayumi Shinohara

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Quasipolynomiality of the Smallest Missing Induced Subgraph ⋮ Standard monomials and extremal point sets

Cites Work

• Unnamed Item
• Results on learnability and the Vapnik-Chervonenkis dimension
• On the density of sets of vectors
• On finding a minimum dominating set in a tournament
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Probably Approximate Learning of Sets and Functions
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable

This page was built for publication: Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions