, Volume 6, Issue 3, pp 217-234

Lower bounds on arithmetic circuits via partial derivatives

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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).

Dedicated to the memory of Roman Smolensky