Michael Kearns, Leslie Valiant  Home/Search
Context Related
Links: ACM DBLP | att.com/~mkearns/papers/crypto.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unm.edu/QA (more) (Enter author homepages) |
Rate this article:      (best)Comment on this 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 from examples. These results are representation independent, in that they hold regardless of the syntactic form in which the learner chooses to represent its hypotheses. Our methods reduce the problems of cracking a number of well-known public-key cryptosystems to the learning problems. We prove that a ... (Update)
Cited by: More
Online Performance-Improvement - Prasad Chalasani August (Correct)
Separating Distribution-Free And Mistake-Bound - Learning Models Over (Correct)
Cryptographic Primitives Based on Hard - Learning Problems Avrim (Correct)
Similar documents (at the sentence level):
65.4%: of Machine Learning - Michael Kearns The (1994) (Correct)
12.8%: Learning in the Presence of Malicious Errors - Kearns (1993) (Correct)
Active bibliography (related documents): More All
0.3: Digital Signets: Self-Enforcing Protection of Digital.. - Dwork, Lotspiech, Naor (1996) (Correct)
0.3: Vertex Removal and Graph Problems - Greenlaw (Correct)
0.3: Efficient Approximation Algorithms for Some Semidefinite Programs - Lu (1996) (Correct)
Similar documents based on text: More All
0.4: Cryptographic Limitations on Learning - Boolean Formulae And (Correct)
0.2: Learning Nonoverlapping Perceptron Networks From Examples and .. - Hancock, Golea (1994) (Correct)
0.2: On the Learnability of Boolean Formulae - Michael Kearns Harvard (1987) (Correct)
Related documents from co-citation: More All
37: Communications of the ACM (context) - Valiant, of et al. - 1984
29: Queries and concept learning (context) - Angluin - 1988
27: A theory of the learnable (context) - Valiant - 1984
BibTeX entry: (Update)
M. Kearns and L. G. Valiant. 1989. Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433--444, New York. ACM. http://citeseer.ist.psu.edu/kearns89cryptographic.html More
@inproceedings{ kearns89cryptographic,
author = "M. Kearns and L. G. Valiant",
title = "Cryptographic limitations on learning {Boolean} formulae and finite automata",
pages = "433--444",
year = "1989",
url = "citeseer.ist.psu.edu/kearns89cryptographic.html" }
Citations (may not include all citations):4212 Computers and intractability: a guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
1529 A method for obtaining digital signatures and public key cry.. - Rivest, Shamir et al. - 1978
1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
537 A theory of the learnable (context) - Valiant - 1984 ACM DBLP
465 Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986 ACM DBLP
339 Theory and application of trapdoor functions (context) - Yao - 1982
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984 ACM DBLP
273 the strength of weak learnability - Schapire - 1989 ACM DBLP
245 A measure of asymptotic efficiency for tests of a hypothesis.. (context) - Chernoff - 1952
244 Learning regular sets from queries and counterexamples (context) - Angluin - 1987
151 A general lower bound on the number of examples needed for l.. (context) - Ehrenfeucht, Haussler et al. - 1989 ACM DBLP
149 Information Processing Letters (context) - Blumer, Ehrenfeucht et al. - 1987
144 Computational limitations on learning from examples (context) - Pitt, Valiant - 1988 ACM DBLP
142 Learning from noisy examples (context) - Angluin, Laird - 1988
132 Fast probabilistic algorithms for Hamiltonian circuits and m.. (context) - Angluin, Valiant - 1979 ACM DBLP
127 Complexity of automaton identification from given data (context) - Gold - 1978 DBLP
102 Training a 3-node neural network is NP-complete - Blum, Rivest - 1988 ACM DBLP
92 Constant depth reducibility (context) - Chandra, Stockmeyer et al. - 1984 DBLP
91 Log depth circuits for division and related problems (context) - Beame, Cook et al. - 1986 ACM DBLP
82 When won't membership queries help (context) - Angluin, Kharitonov - 1991
81 Equivalence of models for polynomial learnability (context) - Haussler, Kearns et al. - 1988 ACM DBLP
78 the learnability of Boolean formulae - Kearns, Li et al. - 1987
68 One-way functions and pseudorandom generators (context) - Levin - 1985 ACM DBLP
62 RSA and Rabin functions: certain parts are as hard as the wh.. (context) - Alexi, Chor et al. - 1988
51 On threshold circuits and polynomial computations - Reif - 1987
45 The minimum consistent DFA problem cannot be approximated wi.. (context) - Pitt, Warmuth - 1989 ACM DBLP
37 the Markov chain simulation method for uniform combinatorial.. (context) - Aldous - 1986
36 A polynomial-time algorithm for learning k-variable pattern .. (context) - Kearns, Pitt - 1989
32 Fourier transform and learnability (context) - Linial, Mansour et al. - 1989
29 Digital signatures and public key functions as intractable a.. (context) - Rabin - 1979
19 On taking roots in finite fields (context) - Adleman, Manders et al. - 1977 DBLP
18 Reductions among prediction problems: on the difficulty of p.. (context) - Pitt, Warmuth - 1988
12 Learning in neural networks (context) - Judd - 1988
9 Lecture notes on the complexity of some problems in number t.. (context) - Angluin - 1982
8 Primality and cryptography (context) - Kranakis - 1986 ACM
6 the learnability of finite automata (context) - Li, Vazirani - 1988
6 approximation algorithm for 3-coloring (context) - Blum - 1989
4 the difficulty of finding small consistent decision trees (context) - Hancock - 1989
3 Transactions on Information Theory (context) - Diffie, Hellman et al. - 1976
3 A new approximate graph coloring algorithm (context) - Wigderson - 1982 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://abbadingo.cs.unm.edu/QA.html):
Efficient Learning of Typical Finite Automata from.. - Freund, Kearns, Ron, .. (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC