Depth-3 arithmetic circuits over fields of characteristic zero

Abstract. In this paper we prove quadratic lower bounds for depth-3 arithmetic circuits over fields of characteristic zero. Such bounds are obtained for the elementary symmetric functions, the (trace of) iterated matrix multiplication, and the determinant. As corollaries we get the first nontrivial lower bounds for computing polynomials of constant degree, and a gap between the power of depth-3 arithmetic circuits and depth-4 arithmetic circuits. We also give new shorter formulae of constant depth for the elementary symmetric functions.¶The main technical contribution relates the complexity of computing a polynomial in this model to the wealth of partial derivatives it has on every affine subspace of small co-dimension. Lower bounds for related models utilize an algebraic analog of the Neciporuk lower bound on Boolean formulae.

[1]  D. Gottlieb.  A certain class of incidence matrices , 1966 .

[2]  Noam Nisan,et al.  Lower bounds for non-commutative computation , 1991, STOC '91.

[3]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[4]  I. Shafarevich.  Basic algebraic geometry , 1974 .

[5]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[6]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[7]  Marek Karpinski,et al.  An exponential lower bound for depth 3 arithmetic circuits , 1998, STOC '98.

[8]  Amir Shpilka.  Affine projections of symmetric polynomials , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[9]  N. S. Barnett,et al.  Private communication , 1969 .

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

[11]  Walter Baur,et al.  The Complexity of Partial Derivatives , 1983, Theor. Comput. Sci..

[12]  Alexander A. Razborov,et al.  Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).