Parity, circuits, and the polynomial-time hierarchy

A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function. Introducing the notion of polynomial-size, constant-depth reduction, similar results are shown for the majority, multiplication, and transitive closure functions. Connections are given to the theory of programmable logic arrays and to the relativization of the polynomial-time hierarchy.

[1]  V. M. Khrapchenko.  Complexity of the realization of a linear function in the class of II-circuits , 1971 .

[2]  V. M. Khrapchenko.  Method of determining lower bounds for the complexity of P-schemes , 1971 .

[3]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[4]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[5]  Wolfgang J. Paul.  A 2.5 n-lower bound on the combinational complexity of Boolean functions , 1975, STOC '75.

[6]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[7]  A. K. Chandra,et al.  Alternation , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[8]  Theodore P. Baker,et al.  A second step toward the polynomial hierarchy , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[9]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[10]  Claus-Peter Schnorr.  A 3n-Lower Bound on the Network Complexity of Boolean Functions , 1980, Theor. Comput. Sci..

[11]  Dana Angluin,et al.  On Counting Problems and the Polynomial-Time Hierarchy , 1980, Theor. Comput. Sci..

[12]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[13]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[14]  Nancy A. Lynch,et al.  Relativization of questions about log space computability , 1976, Mathematical systems theory.