Cryptographic limitations on learning Boolean formulae and finite automata
| Authored By: | M. Kearns and L. G. Valiant |
| Paper Title: | Cryptographic limitations on learning Boolean formulae and finite automata |
| Book/Journal Title: | Proc. of the 21st Symposium on Theory of Computing |
| Publisher: | ACM Press, New York, NY |
| Publication Date: | 1989 |
| Pages: | 433-444 |