Lower Bounds for Sums of Products of Low arity Polynomials

We prove an exponential lower bound for expressing a polynomial as a sum of product of low arity polynomials. Specifically, we show that for the iterated matrix multiplication polynomial, IMMd,n (corresponding to the product of d matrices of size n × n each), any expression of the form IMMd,n = s ∑

[1]  V. Vinay,et al.  Arithmetic Circuits: A Chasm at Depth Four , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[2]  Mark Jerrum,et al.  Some Exact Complexity Results for Straight-Line Computations over Semirings , 1982, JACM.

[3]  Neeraj Kayal,et al.  Arithmetic Circuits: A Chasm at Depth Three , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[4]  Neeraj Kayal,et al.  A super-polynomial lower bound for regular arithmetic formulas , 2014, STOC.

[5]  Amir Yehudayoff,et al.  Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..

[6]  Shubhangi Saraf,et al.  The limits of depth reduction for arithmetic formulas: it's all about the top fan-in , 2013, Electron. Colloquium Comput. Complex..

[7]  Shubhangi Saraf,et al.  Sums of products of polynomials in few variables : lower bounds and polynomial identity testing , 2015, CCC.

[8]  Shubhangi Saraf,et al.  On the Power of Homogeneous Depth 4 Arithmetic Circuits , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[9]  Avi Wigderson,et al.  Depth-3 arithmetic formulae over fields of characteristic zero , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[10]  Shubhangi Saraf,et al.  Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits , 2014, ICALP.

[11]  Sébastien Tavenas,et al.  Improved bounds for reduction to depth 4 and depth 3 , 2013, Inf. Comput..

[12]  Neeraj Kayal,et al.  Approaching the Chasm at Depth Four , 2013, 2013 IEEE Conference on Computational Complexity.

[13]  Noam Nisan,et al.  Lower bounds on arithmetic circuits via partial derivatives , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[14]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

[15]  Pascal Koiran,et al.  Arithmetic circuits: The chasm at depth four gets wider , 2010, Theor. Comput. Sci..

[16]  Nutan Limaye,et al.  Lower bounds for depth 4 formulas computing iterated matrix multiplication , 2014, STOC.

[17]  Nutan Limaye,et al.  An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas , 2017, SIAM J. Comput..

[18]  Amit Chakrabarti,et al.  A Depth-Five Lower Bound for Iterated Matrix Multiplication , 2015, Computational Complexity Conference.

[19]  Neeraj Kayal.  An exponential lower bound for the sum of powers of bounded degree polynomials , 2012, Electron. Colloquium Comput. Complex..

[20]  Nutan Limaye,et al.  Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas , 2014, STOC.

[21]  Neeraj Kayal,et al.  Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin , 2015, Computational Complexity Conference.

[22]  N. Nisan.  Lower Bounds for Non-Commutative Computation (Extended Abstract) , 1991, STOC 1991.

[23]  Laurent Hyafil.  On the Parallel Evaluation of Multivariate Polynomials , 1979, SIAM J. Comput..

[24]  Meena Mahajan,et al.  Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds , 1998, Theor. Comput. Sci..