Lower bounds on arithmetic circuits via partial derivatives

Noam Nisan, Avi Wigderson

Research output: Contribution to journalArticlepeer-review

154 Scopus citations


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

Original languageAmerican English
Pages (from-to)217-234
Number of pages18
JournalComputational Complexity
Issue number3
StatePublished - 1996


  • Arithmetic circuits
  • Circuit complexity
  • Iterated matrix product
  • Lower bounds


Dive into the research topics of 'Lower bounds on arithmetic circuits via partial derivatives'. Together they form a unique fingerprint.

Cite this