Lower bounds on arithmetic circuits via partial derivatives

In this paper we describe a new technique for obtaining lower bounds on restricted classes of non-monotone arithmetic circuits. The heart of this technique is a complexity measure for multivariate polynomials, based on the linear span of their partial derivatives. We use the technique to obtain new lower bounds for computing symmetric polynomials (that hold over fields of characteristic zero) and iterated matrix products (that hold for all fields).

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

[2]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

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

[4]  Jens Palsberg,et al.  Eta-expansion does The Trick , 1995, TOPL.

[5]  Marc Snir,et al.  On the depth complexity of formulas , 1979, Mathematical systems theory.

[6]  Kurt Mehlhorn,et al.  On the Average Number of Rebalancing Operations in Weight-Balanced Trees , 1980, Theor. Comput. Sci..

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

[8]  Mayer Goldberg.  Constructing Fixed-Point Combina- tors Using Application Survival , 1995 .

[9]  K. Ramachandra,et al.  Vermeidung von Divisionen. , 1973 .

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

[11]  Sten Agerholm,et al.  Experiments with ZF Set Theory in HOL and Isabelle , 1995, TPHOLs.

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

[13]  A. Ingólfsdóttir,et al.  A Fully Abstract Denotational Model for Observational Congruence , 1995 .

[14]  M. Goldberg.  An Adequate Left-Associated Binary Numeral System in the-Calculus ( Revised Version ) , 1995 .

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

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

[17]  Roman Smolensky.  On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[18]  Allan Cheng,et al.  Petri Nets, Traces, and Local Model Checking , 1995, Theor. Comput. Sci..