Cryptographic limitations on learning Boolean formulae and finite automata
Work
Year: 1994
Type: article
Abstract: In this paper, we prove the intractability of learning several classes of Boolean functions in the distribution-free model (also called the Probably Approximately Correct or PAC model) of learning fro... more
Source: Journal of the ACM
Authors Michael Kearns, Leslie G. Valiant
Institutions AT&T (United States), Harvard University Press
Cites: 52
Cited by: 728
Related to: 10
FWCI: 20.26
Citation percentile (by year/subfield): 99.99
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze