by Alexander A. Razborov
Proceedings of the 3rd SWAT Scandinavian Workshop on Algorithm Theory, Helsinki, Finland (LNCS 621
http://genesis.mi.ras.ru/~razborov/helsinki.ps
Add To MetaCart
Abstract:
In this talk we will consider various classes defined by small depth polynomial size circuits which contain threshold gates and parity gates. We will describe various inclusions between many classes defined in this way and also classes whose definitions rely upon spectral properties of Boolean functions. 1.
Citations
|
1390
|
Introduction to the Theory of Neural Computation
– Hertz, Krogh, et al.
- 1991
|
|
199
|
Constant depth circuits, Fourier transform, and learnability
– Linial, Mansour, et al.
- 1993
|
|
122
|
Learning decision trees using the Fourier spectrum
– Kushilevitz, Mansour
- 1993
|
|
118
|
The Influence of Variables on Boolean Functions
– Kahn, Kalai, et al.
- 1988
|
|
115
|
Log depth circuits for division and related problems
– Beame, Cook, et al.
- 1986
|
|
106
|
Constant-depth reducibility
– Chandra, Stockmeyer, et al.
- 1984
|
|
79
|
Harmonic analysis of polynomial threshold functions,” preprint
– Bruck
- 1988
|
|
68
|
On the power of small-depth threshold circuits
– H˚astad, Goldmann
- 1991
|
|
66
|
Majority gates vs. general weighted threshold gates
– Goldmann, H˚astad, et al.
- 1992
|
|
65
|
On the computational power of sigmoid versus boolean threshold circuits
– Maass, Schnitger, et al.
- 1991
|
|
48
|
Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In. FOCS 777–782
– Krause, Waack
- 1991
|
|
34
|
Polynomial threshold functions, ac functions and spectral norms
– Bruck, Smolensky
- 1990
|
|
21
|
Explicit constructions of depth-2 majority circuits for comparison and addition
– Alon, Bruck
- 1991
|
|
20
|
A spectral lower bound technique for the size of decision trees and two-level and-or circuits
– Brandman, Orlitsky, et al.
- 1990
|
|
18
|
Some notes on threshold circuits and multiplication
– Hofmeister, Hohberg, et al.
- 1991
|
|
18
|
On the size of weights required for linear-input switching functions
– Myhill, Kautz
- 1961
|
|
15
|
bounds on the size of bounded-depth networks over a complete basis with logical addition
– Lower
- 1987
|
|
14
|
Geometric arguments yield better bounds for threshold circuits and distributed computing
– Krause
- 1991
|
|
14
|
The complexity of computations by networks
– Pippenger
- 1987
|
|
11
|
A note on a theorem of Razborov
– Barrington
- 1986
|
