Abstract
We show that over the field of complex numbers, every homogeneous polynomial of degree d can be approximated (in the border complexity sense) by a depth-3 arithmetic circuit of top fan-in at most 2. This is quite surprising, since there exist homogeneous polynomials P on n variables of degree 2, such that any depth-3 arithmetic circuit computing P must have top fan-in at least Ω (n).
As an application, we get a new tradeoff between the top fan-in and formal degree in an approximate analog of the celebrated depth reduction result of Gupta, Kamath, Kayal, and Saptharishi [7, 10]. Formally, we show that if a degree d homogeneous polynomial P can be computed by an arithmetic circuit of size s ≥ d, then for every t ≤ d, P is in the border of a depth-3 circuit of top fan-in sO(t) and formal degree sO(d/t). To the best of our knowledge, the upper bound on the top fan-in in the original proof of Reference [7] is always at least sΩ (√d), regardless of the formal degree.
- Manindra Agrawal and V. Vinay. 2008. Arithmetic circuits: A chasm at depth four. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS’08). 67--75. DOI:https://doi.org/10.1109/FOCS.2008.32Google Scholar
- Eric Allender and Fengming Wang. 2016. On the power of algebraic branching programs of width two. Comput. Complex. 25, 1 (2016), 217--253. DOI:https://doi.org/10.1007/s00037-015-0114-7Google Scholar
Digital Library
- Michael Ben-Or and Richard Cleve. 1988. Computing algebraic formulas using a constant number of registers. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC’88). 254--257.Google Scholar
- Peter Bürgisser. 2004. The complexity of factors of multivariate polynomials. Found. Comput. Math. 4, 4 (2004), 369--396. DOI:https://doi.org/10.1007/s10208-002-0059-5Google Scholar
Digital Library
- Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, and Ning Xie. 2018. AC0 ○ MOD2 lower bounds for the Boolean inner product. J. Comput. Syst. Sci. 97 (2018), 45--59. DOI:https://doi.org/10.1016/j.jcss.2018.04.006Google Scholar
Cross Ref
- Ismor Fischer. 1994. Sums of like powers of multivariate linear forms. Math. Mag. 67, 1 (1994), 59--61. http://www.jstor.org/stable/2690560Google Scholar
Cross Ref
- Ankit Gupta, Pritish Kamath, Neeraj Kayal, and Ramprasad Saptharishi. 2016. Arithmetic circuits: A chasm at depth 3. SIAM J. Comput. 45, 3 (2016), 1064--1079. DOI:https://doi.org/10.1137/140957123Google Scholar
Cross Ref
- Noam Nisan and Avi Wigderson. 1997. Lower bounds on arithmetic circuits via partial derivatives. Comput. Complex. 6, 3 (1997), 217--234. DOI:https://doi.org/10.1007/BF01294256 Available on citeseer:10.1.1.90.2644.Google Scholar
Digital Library
- Amir Shpilka. 2002. Affine projections of symmetric polynomials. J. Comput. System Sci. 65, 4 (2002), 639--659. DOI:https://doi.org/10.1016/S0022-0000(02)00021-1 Special Issue on Complexity 2001.Google Scholar
Digital Library
- Sébastien Tavenas. 2015. Improved bounds for reduction to depth 4 and depth 3. Inf. Comput. 240 (2015), 2--11. DOI:https://doi.org/10.1016/j.ic.2014.09.004Google Scholar
Digital Library
- Karl Bringmann, Christian Ikenmeyer, and Jeroen Zuiddam. 2018. On algebraic branching programs of small width. J. ACM 65, 5 (2018), 32:1--32:29. https://doi.org/10.1145/3209663Google Scholar
Digital Library
Index Terms
On the Power of Border of Depth-3 Arithmetic Circuits
Recommendations
The Computational Power of Depth Five Arithmetic Circuits
Surprising and beautiful depth reduction results show that sufficiently strong lower bounds for bounded-depth arithmetic circuits imply superpolynomial lower bounds for general arithmetic circuits. Motivated by this, in the last few years, there has been ...
Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin
Shpilka & Wigderson (IEEE conference on computational complexity, vol 87, 1999) had posed the problem of proving exponential lower bounds for (nonhomogeneous) depth-three arithmetic circuits with bounded bottom fanin over a field $${{\mathbb{F}}}$$F of ...
Hardness vs randomness for bounded depth arithmetic circuits
CCC '18: Proceedings of the 33rd Computational Complexity ConferenceIn this paper, we study the question of hardness-randomness tradeoffs for bounded depth arithmetic circuits. We show that if there is a family of explicit polynomials {fn}, where fn is of degree O(log2 n/log2 logn) in n variables such that fn cannot be ...






Comments