• DOI:10.1145/73007.73049
Corpus ID: 536357

Crytographic limitations on learning Boolean formulae and finite automata

@inproceedings{Kearns1989CrytographicLO,
  title={Crytographic limitations on learning Boolean formulae and finite automata},
  author={M. Kearns and L. Valiant},
  booktitle={STOC '89},
  year={1989}
}

• M. Kearns, L. Valiant
• Published in STOC '89 1989
• Mathematics, Computer Science

In this paper we consider the problem of learning from examples classes of functions when there are no restrictions on the allowed hypotheses other than that they are polynomial time evaluatable. We prove that for Boolean formulae, finite automata, and constant depth threshold circuits (simplified neural nets), this problem is computationally as difficult as the quadratic residue problem, inverting the RSA function and factoring Blum integers (composite number p q where p and q are both primes… Expand

View on ACM

cis.upenn.edu

Save to Library

Create Alert

Cite

Launch Research Feed