Learning Boolean Functions via the Fourier Transform
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 391-424
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Cryptographic hardness of distribution-specific learning1993
- A technique for upper bounding the spectral norm with applications to learning1992
- On the Power of Threshold Circuits with Small WeightsSIAM Journal on Discrete Mathematics, 1991
- Learning decision trees using the Fourier spectrum1991
- Harmonic Analysis of Polynomial Threshold FunctionsSIAM Journal on Discrete Mathematics, 1990
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- A spectral lower bound technique for the size of decision trees and two-level AND/OR circuitsIEEE Transactions on Computers, 1990
- A hard-core predicate for all one-way functions1989
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983