Learnability and the Vapnik-Chervonenkis dimension

doi:10.1145/76359.76371

Learnability and the Vapnik-Chervonenkis dimension

Full Text:

PDF

Buy this Article

Authors:	Anselm Blumer	Tufts Univ., Medford, MA
	A. Ehrenfeucht	Univ. of Colorado at Boulder, Boulder
	David Haussler	Univ. of California at Santa Cruz, Santa Cruz
	Manfred K. Warmuth	Univ. of California at Santa Cruz, Santa Cruz

	1989 Article
Bibliometrics
· Downloads (6 Weeks): 15 · Downloads (12 Months): 161 · Downloads (cumulative): 3,150 · Citation Count: 338

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 36 Issue 4, Oct. 1989
Pages 929-965
ACM New York, NY, USA
table of contents doi>10.1145/76359.76371

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms design learning performance probabilistic algorithms reducibility and completeness theory verification

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder