Michael J. Kearns, Leslie G. Valiant. Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 15-17 May 1989, Seattle, Washington, USA. pages 433-444, ACM, 1989.
@inproceedings{KearnsV89,
title = {Cryptographic Limitations on Learning Boolean Formulae and Finite Automata},
author = {Michael J. Kearns and Leslie G. Valiant},
year = {1989},
researchr = {https://researchr.org/publication/KearnsV89},
cites = {0},
citedby = {0},
pages = {433-444},
booktitle = {Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, 15-17 May 1989, Seattle, Washington, USA},
publisher = {ACM},
}