Cryptographic limitations on learning Boolean formulae and finite automata
- 2 January 1994
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 41 (1) , 67-95
- https://doi.org/10.1145/174644.174647
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- Occam's RazorInformation Processing Letters, 1987
- How to construct random functionsJournal of the ACM, 1986
- A theory of the learnableCommunications of the ACM, 1984
- Constant Depth ReducibilitySIAM Journal on Computing, 1984
- Complexity of automaton identification from given dataInformation and Control, 1978
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952