Abstract
This article is a survey of techniques used in arithmetic circuit lower bounds.
Keywords
Mathematics Subject Classification (2010)
It is convenient to have a measure of the amount of work involved in a computing process, even though it may be a very crude one ...We might, for instance, count the number of additions, subtractions, multiplications, divisions, recordings of numbers,... from Rounding-off errors in matrix processes, Alan M. Turing, 1948
To Somenath Biswas, on his 60th Birthday.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
One can also allow more arithmetic operations such as division and square roots. It turns out, however, that one can efficiently simulate any circuit with divisions and square roots by another circuit without these operations while incurring only a polynomial factor increase in size.
- 2.
A more specialized survey by Chen, Kayal, and Wigderson [CKW11] focuses on the applications of partial derivatives in understanding the structure and complexity of polynomials.
- 3.
in the sense that any polynomial can be computed in this model albeit of large size.
- 4.
such circuits are also called diagonal depth- \(3\) circuits in the literature.
- 5.
It is a forklore result that any circuit can be homogenized with just a polynomial blowup in size. Further, this process also preserves monotonicity of the circuit. A proof of this may be seen in [SY10].
- 6.
The binary entropy function is defined as \(H(\gamma ) \mathop {=}\limits ^{\text {def}}-\gamma \log _2(\gamma ) - (1-\gamma )\log _2(1-\gamma )\). It is well known that \(\left( {\begin{array}{c}n\\ k\end{array}}\right) \approx 2^{nH(k/n)}\).
- 7.
provided the underlying field is large, but this isn’t really a concern as we can work with a large enough extension if necessary.
- 8.
Some of the complexity measures that we describe here yield lower bounds for slightly more general subclasses of circuits.
References
E. Allender, J. Jiao, M. Mahajan, V. Vinay, Non-commutative arithmetic circuits: depth reduction and size lower bounds. Theor. Comput. Sci. 209(1–2), 47–86 (1998)
M. Agrawal, C. Saha, R. Saptharishi, N. Saxena, Jacobian hits circuits: hitting-sets, lower bounds for depth-d occur-k formulas and depth-3 transcendence degree-k circuits. in Symposium on Theory of Computing (STOC) (2012), pp. 599–614
M. Agrawal, V. Vinay, Arithmetic circuits: a chasm at depth four. in Foundations of Computer Science (FOCS) (2008), pp. 67–75
W. Baur, V. Strassen, The complexity of partial derivatives. Theor. Comput. Sci. 22, 317–330 (1983)
X. Chen, N. Kayal, A. Wigderson, Partial derivatives in arithmetic complexity (and beyond). Found. Trends Theor. Comput. Sci. 6, 1–138 (2011)
D.A. Cox, J.B. Little, D. O’Shea, Ideals (Springer, Varieties and Algorithms. Undergraduate texts in mathematics, 2007)
S. Chillara, P. Mukhopadhyay, Depth-4 lower bounds, determinantal complexity: a unified approach. in Symposium on Theoretical Aspects of Computing (STACS) (2014)
H. Fournier, N. Limaye, G. Malod, S. Srinivasan, Lower bounds for depth 4 formulas computing iterated matrix multiplication. Electron. Colloquium Comput. Complex. 20, 100 (2013)
D. Grigoriev, M. Karpinski, An exponential lower bound for depth 3 arithmetic circuits. in Symposium on Theory of Computing (STOC) (1998), pp. 577–582
A. Gupta, P. Kamath, N. Kayal, R. Saptharishi, Approaching the chasm at depth four. in Conference on Computational Complexity (CCC) (2013)
D. Grigoriev, A.A. Razborov, Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. Appl. Algebra Eng. Commun. Comput. 10(6), 465–487 (2000)
P. Hrubeš, A. Yehudayoff, Arithmetic complexity in ring extensions. Theor. Comput. 7(8), 119–129 (2011)
M. Jerrum, M. Snir, Some exact complexity results for straight-line computations over semirings. J. ACM 29(3), 874–897 (1982)
K. Kalorkoti, A lower bound for the formula size of rational functions. SIAM J. Comput. 14(3), 678–687 (1985)
N. Kayal, An exponential lower bound for the sum of powers of bounded degree polynomials. Technical report, Electronic Colloquium on Computational Complexity (ECCC) (2012)
P. Koiran, Arithmetic circuits: the chasm at depth four gets wider. Theor. Comput. Sci. 448, 56–65 (2012)
I. Koutis, Faster algebraic algorithms for path and packing problems. in ICALP (2008), pp. 575–586
N. Kayal, C. Saha, R. Saptharishi, A super-polynomial lower bound for regular arithmetic formulas. Electron. Colloquium Comput. Complex. 20, 91 (2013)
S. Lovett, Computing polynomials with few multiplications. Theor. Comput. 7(13), 185–188 (2011)
N. Nisan, Lower bounds for non-commutative computation. in Symposium on Theory of Computing (STOC) (1991), pp. 410–418
N. Nisan, A. Wigderson, Hardness versus randomness. J. Comput. Syst. Sci. 49(2), 149–167 (1994)
N. Nisan, A. Wigderson, Lower bounds on arithmetic circuits via partial derivatives. Comput. Complex. 6(3), 217–234 (1997)
R. Raz, Separation of multilinear circuit and formula size. Theor. Comput. 2(1), 121–135 (2006)
R. Raz, Multi-linear formulas for permanent and determinant are of super-polynomial size. J. ACM 56(2), 1–17 (2009)
R. Raz, Tensor-rank and lower bounds for arithmetic formulas. in Symposium on Theory of Computing (STOC) (2010), pp. 659–666
R. Raz, A. Shpilka, A. Yehudayoff, A lower bound for the size of syntactically multilinear arithmetic circuits. SIAM J. Comput. 38(4), 1624–1647 (2008)
R. Raz, A. Yehudayoff, Lower bounds and separations for constant depth multilinear circuits. Comput. Complex. 18(2), 171–207 (2009)
S. Srinivasan, personal communication (2013)
A. Shpilka, A. Wigderson, Depth-3 arithmetic circuits over fields of characteristic zero. Comput. Complex. 10(1), 1–27 (2001)
A. Shpilka, A. Yehudayoff, Arithmetic circuits: a survey of recent results and open questions. Found. Trends Theor. Comput. Sci. 5, 207–388 (2010)
S. Tavenas, Improved bounds for reduction to depth 4 and depth 3. in Mathematical Foundations of Computer Science (MFCS) (2013)
L.G. Valiant, S. Skyum, S. Berkowitz, C. Rackoff, Fast parallel computation of polynomials using few processors. SIAM J. Comput. 12(4), 641–644 (1983)
A. Wigderson, Arithmetic complexity—a survey. Lecture Notes (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Kayal, N., Saptharishi, R. (2014). A Selection of Lower Bounds for Arithmetic Circuits. In: Agrawal, M., Arvind, V. (eds) Perspectives in Computational Complexity. Progress in Computer Science and Applied Logic, vol 26. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-05446-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-05446-9_5
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-05445-2
Online ISBN: 978-3-319-05446-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)