Abstract:
Consider circuits consisting of a threshold gate at the top, Modm gates at the next level (for a fixed m), and polylog fan-in AND gates at the lowest level. It is a difficult and important open problem to obtain exponential lower bounds for such circuits. Here we prove exponential lower bounds for restricted versions of this model, in which each Modm-of-AND subcircuit is a symmetric function of the inputs to that subcircuit. We show that if q is a prime not dividing m, the Mod q function requires exponential size circuits of this type. This generalizes recent results and techniques of Cai, Green and Thierauf [CGT] (which held only for q = 2) and Goldmann (which held only for depth two threshold over Modm circuits). As a further generalization of the [CGT] result, the symmetry condition on the Modm sub-circuits can be relaxed somewhat, still resulting in an exponential lower bound. The basis of the proof is to reduce the problem to estimating an exponential sum, which generalizes the notion of "correlation " studied by [CGT]. This identifies the type of exponential sum that will be instrumental in proving the general case. Along the way we substantially simplify previous proofs.
Citations
|
333
|
Finite Fields
– Lidl, Niederreiter
- 1983
|
|
254
|
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
– Smolensky
- 1987
|
|
202
|
Parity, circuits, and the polynomial-time hierarchy
– Furst, Saxe, et al.
- 1984
|
|
191
|
Bounded-width polynomial-size branching programs recognize exactly those languages in NC
– Barrington
- 1989
|
|
173
|
PP is as hard as the polynomial-time hierarchy
– Toda
- 1991
|
|
165
|
Separating the polynomial-time hierarchy by oracles
– Yao
- 1985
|
|
119
|
Threshold circuits of bounded depth
– Hajnal, Maass, et al.
- 1987
|
|
87
|
On ACC and threshold circuits
– Yao
- 1990
|
|
84
|
A note on the power of threshold circuits
– Allender
- 1989
|
|
72
|
On the power of small-depth threshold circuits
– Hastad, Goldmann
- 1991
|
|
54
|
Representing boolean functions as polynomials modulo composite numbers
– Barrington, Beigel, et al.
- 1994
|
|
46
|
bounds on the size of bounded depth networks over a complete basis with logical addition
– Razborov, Lower
- 1987
|
|
45
|
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
– Cai
- 1989
|
|
41
|
On the computational power of depth 2 circuits with threshold and modulo gates
– Krause, Pudlak
- 1994
|
|
41
|
Equations over finite fields: An elementary approach
– Schmidt
- 1976
|
|
13
|
The power of the middle bit of a #P function
– Green, obler, et al.
- 1995
|
|
10
|
An oracle separating \PhiP from
– Green
- 1991
|
|
9
|
On the correlation of symmetric functions
– Cai, Green, et al.
- 1996
|
|
9
|
A note on the power of majority gates and modular gates
– Goldmann
- 1995
|
|
9
|
astad, Computational limitations of small-depth circuits
– H
- 1987
|
|
6
|
Sommes exponentielles, Ast'erisque 79
– Katz
- 1980
|
|
4
|
Multiple trigonometric sums
– Arhipov, Karacuba, et al.
- 1980
|
|
