Cryptographic limitations on learning Boolean formulae and finite automata
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 29-49
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- An O(n0.4)-approximation algorithm for 3-coloring1989
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- Occam's RazorInformation Processing Letters, 1987
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986
- Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension1986
- Constant Depth ReducibilitySIAM Journal on Computing, 1984
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- On taking roots in finite fields1977
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952