Learning Decision Trees Using the Fourier Spectrum
- 1 December 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (6) , 1331-1348
- https://doi.org/10.1137/0222080
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Simple construction of almost k-wise independent random variablesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the Power of Threshold Circuits with Small WeightsSIAM Journal on Discrete Mathematics, 1991
- Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$SIAM Journal on Computing, 1991
- 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
- Learning decision trees from random examplesInformation and Computation, 1989
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983