Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin

We study the class of homogenous ΣΠΣΠ(r) circuits, which are depth 4 homogenous circuits with top fanin bounded by r. We show that any homogenous ΣΠΣΠ(r) circuit computing the permanent of an n× n matrix must have size at least exp ( n ) . In a recent result, Gupta, Kamath, Kayal and Saptharishi [6] showed that any homogenous depth 4 circuit with bottom fanin bounded by t which computes the permanent of an n×n matrix must have size at least exp (Ω(n/t)). Our work builds upon the results of [6], and explores the limits of computation of depth four homogenous circuits when the restriction for the bottom fanin is removed. For any sequence D = D1, D2, . . . , Dk of nonnegative integers such that ∑ Di = n, we also study the class of homogenous ΣΠDΣΠ circuits, which are homogenous circuits where each Π gate at the second layer (from the the top) is restricted to having its inputs be polynomials whose sequence of degrees is precisely D. We show that for every degree sequence D, any ΣΠDΣΠ circuit computing the permanent of an n× n matrix must have size at least exp (n ), for some fixed absolute constant independent of D. ∗Department of Computer Science, Rutgers University. Email: mrinal.kumar@rutgers.edu. †Department of Computer Science and Department of Mathematics, Rutgers University. Email: shubhangi.saraf@gmail.com.

[1]  Zeev Dvir,et al.  Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits , 2005, STOC '05.

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

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

[4]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[5]  Nitin Saxena,et al.  Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter , 2012, SIAM J. Comput..

[6]  Nitin Saxena,et al.  From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits , 2010, FOCS.

[7]  Neeraj Kayal,et al.  Polynomial Identity Testing for Depth 3 Circuits , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[8]  Amir Shpilka,et al.  Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

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

[10]  Ilya Volkovich,et al.  Black-Box Identity Testing of Depth-4 Multilinear Circuits , 2011, Combinatorica.

[11]  Manindra Agrawal,et al.  Proving Lower Bounds Via Pseudo-random Generators , 2005, FSTTCS.

[12]  Russell Impagliazzo,et al.  Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.

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

[14]  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).

[15]  Zeev Dvir,et al.  Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits , 2007, SIAM J. Comput..

[16]  Neeraj Kayal,et al.  An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin , 2012, Electron. Colloquium Comput. Complex..

[17]  Ilya Volkovich,et al.  Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in , 2013, SIAM J. Comput..

[18]  Shubhangi Saraf,et al.  Blackbox Polynomial Identity Testing for Depth 3 Circuits , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[19]  Avi Wigderson,et al.  Depth-3 arithmetic circuits over fields of characteristic zero , 2002, computational complexity.

[20]  Marek Karpinski,et al.  An exponential lower bound for depth 3 arithmetic circuits , 1998, STOC '98.

[21]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

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

[23]  Nitin Saxena,et al.  From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.