Depth-3 arithmetic formulae over fields of characteristic zero

In this paper we prove near quadratic lower bounds for depth-3 arithmetic formulae 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 non-trivial lower bounds for computing polynomials of constant degree, and a gap between the power depth-3 arithmetic formulas and depth-4 arithmetic formulas. 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 Nechiporuk lower bound on Boolean formulae.

[1]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

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

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

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

[5]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

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

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

[8]  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).

[9]  J. Gathen.  Algebraic complexity theory , 1988 .

[10]  R. Tennant.  Algebra , 1941, Nature.

[11]  J. Milnor.  Topology from the differentiable viewpoint , 1965 .

[12]  Alexander A. Razborov,et al.  Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields , 2000, Applicable Algebra in Engineering, Communication and Computing.

[13]  Martin Tompa,et al.  A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth , 1994, Inf. Process. Lett..

[14]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

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

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

[17]  Leslie G. Valiant,et al.  Negation can be exponentially powerful , 1979, Theor. Comput. Sci..

[18]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[19]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[20]  Noam Nisan,et al.  Lower bounds on arithmetic circuits via partial derivatives , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.