Abstract
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 language | English |
---|---|
Pages (from-to) | 217-234 |
Number of pages | 18 |
Journal | Computational Complexity |
Volume | 6 |
Issue number | 3 |
DOIs | |
State | Published - 1996 |
Keywords
- Arithmetic circuits
- Circuit complexity
- Iterated matrix product
- Lower bounds