Learning functions represented as multiplicity automata

doi:10.1145/337244.337257

Learning functions represented as multiplicity automata

Full Text:

PDF

Buy this Article

Authors:	Amos Beimel	Harvard Univ., Cambridge, MA
	Francesco Bergadano	Univ. di Torino, Turin, Italy
	Nader H. Bshouty	Univ. of Calgary, Calgary, Alta., Canada
	Eyal Kushilevitz	Technion, Haifa, Israel
	Stefano Varricchio	Univ. de L'Aquila, L'Aquila, Italy

	2000 Article
Bibliometrics
· Downloads (6 Weeks): 5 · Downloads (12 Months): 53 · Downloads (cumulative): 815 · Citation Count: 25

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 47 Issue 3, May 2000
Pages 506-530
ACM New York, NY, USA
table of contents doi>10.1145/337244.337257

Tools and Resources

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

Share:

|

Tags: algorithms computational learning dnf learning learning disjoint learning polynomials models of computation multiplicity automata theory

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