Lower bounds on arithmetic circuits via partial derivatives
Rent the article at a discountRent 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).
- N. Alon, J. Spencer., and P. Erdös,The probabilistic method. Wiley, 1991.
- M. Ben-Or, Private communication.
- Gathen, J. (1988) Algebraic complexity theory. Annual Review of Computer Science 3: pp. 317-347
- G. H. Gottlieb, A certain class of incidence matrices. InProc. AMS 17, 1966, 1233–1237.
- N. Nisan, Lower bounds for non-commutative computation. InSTOC 1991, 1991, 410–418.
- Shamir, E., Snir, M. (1980) On the depth complexity of formulas. Math. Systems theory 13: pp. 301-322
- Roman Smolensky, On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates. In31st FOCS, 1990, 628–631.
- Strassen, V. (1973) Vermeidung von Divisionen. J. reine u. angew. Math. 264: pp. 182-202
- P. Tiwari and M. Tompa, A direct version of Shamir and Snir's lower bounds on monotone circuit depth.Information Processing Letters (1994), p. 49.
- Valiant, L. (1980) Negation can be exponentially powerful. TCS 12 11: pp. 303-314
- Valiant, L., Skyum, S., Berkowitz, S., Rackoff, C. (1983) Fast parallel computation of polynomials using few processors. SIAM J. Comput. 12: pp. 641-644
- Lower bounds on arithmetic circuits via partial derivatives
Volume 6, Issue 3 , pp 217-234
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Circuit complexity
- arithmetic circuits
- lower bounds
- iterated matrix product
- Industry Sectors