# 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} }

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

#### Topics from this paper

#### 240 Citations

From average case complexity to improper learning complexity

- Computer Science, Mathematics
- STOC
- 2014

A Real generalization of discrete AdaBoost

- Computer Science, Mathematics
- Artif. Intell.
- 2007

Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree

- Computer Science
- IJCAI
- 2007

New Results for Learning Noisy Parities and Halfspaces

- Mathematics, Computer Science
- 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
- 2006

Hardness Results for Learning First-Order Representations and Programming by Demonstration

- Computer Science
- Machine Learning
- 2004

The minimum consistent DFA problem cannot be approximated within any polynomial

- Mathematics, Computer Science
- JACM
- 1993

Inductive Inference, DFAs, and Computational Complexity

- Computer Science
- AII
- 1989

Complexity Theoretic Limitations on Learning DNF's

- Computer Science, Mathematics
- COLT
- 2016

#### References

SHOWING 1-5 OF 5 REFERENCES

An d(n(] ‘)-approximation algorlthm for 3-coloring

- Proceedings of the 21sr ACM Symposuon on the Theow of Computmg
- 1989

Digital signatures and public key functions as intractable as factoring

- M.I.T. Laboratory for Computer Science, technical report number TM-212
- 1979

Complexity of Automaton Identification from Given Data

- Computer Science, Mathematics
- Inf. Control.
- 1978

Log depth cu’cults for dwlslon and related problems

- SIAM J. Comput. 15, 4 (1986), 994-1003.
- 1986

How to generate cryptographically strong sequences of pseudo random bits

- Mathematics, Computer Science
- 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
- 1982