Constant depth circuits, Fourier transform, and learnability

A theory of the learnable

1984 • 4,471 citations

A theory of the learnable

1984 • 2,968 citations

How to construct random functions

1986 • 2,086 citations

Theory and application of trapdoor functions

1982 • 1,080 citations

Parity, circuits, and the polynomial-time hierarchy

1984 • 964 citations

Theory and application of trapdoor functions

1982 • 872 citations

Algebraic methods in the theory of lower bounds for Boolean circuit complexity

1987 • 790 citations

Untitled

1987 • 790 citations

The influence of variables on Boolean functions

1988 • 643 citations

∑11-Formulae on finite structures

1983 • 589 citations

Separating the polynomial-time hierarchy by oracles

1985 • 573 citations

Fourier Series and Integrals

1949 • 565 citations

Computational limitations of small-depth circuits

1987 • 502 citations

Learning decision lists

1987 • 356 citations

Handbook of theoretical computer science

1992 • 347 citations

Crytographic limitations on learning Boolean formulae and finite automata

1989 • 272 citations

Parity, circuits, and the polynomial-time hierarchy

1981 • 202 citations

Generic oracles and oracle classes

1987 • 160 citations

Hardness vs. randomness

1988 • 98 citations

The computational complexity of universal hashing

1990 • 88 citations

Deterministic simulation of probabilistic constant depth circuits

1985 • 77 citations

Approximate inclusion-exclusion

1990 • 70 citations

One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets

1987 • 65 citations

A spectral lower bound technique for the size of decision trees and two-level AND/OR circuits

1990 • 42 citations