Threshold circuits of bounded depth

We examine a powerful model of parallel computation: polynomial size threshold circuits of bounded depth (the gates compute threshold functions with polynomial weights). Lower bounds are given to separate polynomial size threshold circuits of depth 2 from polynomial size threshold circuits of depth 3, and from probabilistic polynomial size threshold circuits of depth 2. We also consider circuits of unreliable threshold gates, circuits of imprecise threshold gates and threshold quantifiers.

[1]  J. von Neumann,et al.  Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .

[2]  L. Hodes,et al.  Implementing the Algebra of Logic Functions in Terms of Bounded Depth Formulas in the Basis of , 1961 .

[3]  Marvin Minsky,et al.  Perceptrons: An Introduction to Computational Geometry , 1969 .

[4]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[5]  Mike Paterson,et al.  The Depth of All Boolean Functions , 1975, SIAM J. Comput..

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

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

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

[9]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[10]  Sven Skyum.  A Measure in Which Boolean Negation is Exponentially Powerful , 1983, Inf. Process. Lett..

[11]  Neil Immerman.  Languages which capture complexity classes , 1983, STOC '83.

[12]  Hans Ulrich Simon.  A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions , 1983, FCT.

[13]  Yuri Gurevich,et al.  A Logic for Constant-Depth Circuits , 1984, Inf. Control..

[14]  Michael Ben-Or,et al.  A theorem on probabilistic constant depth Computations , 1984, STOC '84.

[15]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[16]  György Turán,et al.  The Critical Complexity of Graph Properties , 1984, Information Processing Letters.

[17]  Béla Bollobás,et al.  Random Graphs , 1985 .

[18]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

[19]  Nicholas Pippenger,et al.  On networks of noisy gates , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[20]  Oded Goldreich,et al.  Unbiased bits from sources of weak randomness and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[21]  Ronald Fagin,et al.  Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions , 1985, Theoretical Computer Science.

[22]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[23]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1986, SIAM J. Comput..

[24]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[25]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[26]  Georg Schnitger,et al.  Parallel Computation with Threshold Functions , 1986, J. Comput. Syst. Sci..

[27]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[28]  James L. McClelland,et al.  Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

[29]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[30]  Denis Thérien,et al.  Finite monoids and the fine structure of NC1 , 1987, STOC.

[31]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[32]  Georg Schnitger,et al.  Parallel Computation with Threshold Functions , 1988, J. Comput. Syst. Sci..

[33]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[34]  David A. Mix Barrington,et al.  Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ , 1989, J. Comput. Syst. Sci..