Black-Box Identity Testing of Depth-4 Multilinear Circuits

We study the problem of identity testing for multilinear ΣΠΣΠ(k) circuits, i.e. multilinear depth-4 circuits with fan-in k at the top + gate. We give the first polynomial-time deterministic identity testing algorithm for such circuits. Our results also hold in the black-box setting. The running time of our algorithm is (ns)O(k3), where n is the number of variables, s is the size of the circuit and k is the fan-in of the top gate. The importance of this model arises from [3], where it was shown that derandomizing black-box polynomial identity testing for general depth-4 circuits implies a derandomization of polynomial identity testing (PIT) for general arithmetic circuits. Prior to our work, the best PIT algorithm for multilinear ΣΠΣΠ(k) circuits [13] ran in quasi-polynomial-time, with the running time being nO(k6 log(k) log2 s ). We obtain our results by showing a strong structural result for multilinear ΣΠΣΠ(k) circuits that compute the zero polynomial. We show that under some mild technical conditions, any gate of such a circuit must compute a sparse polynomial. We then show how to combine the structure theorem with a result by Klivans and Spielman [17], on the identity testing for sparse polynomials, to yield the full result.

[1]  Vikraman Arvind,et al.  The ideal membership problem and polynomial identity testing , 2010, Inf. Comput..

[2]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[3]  Daniel A. Spielman,et al.  Randomness efficient identity testing of multivariate polynomials , 2001, STOC '01.

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

[5]  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.

[6]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[7]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

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

[9]  Amir Shpilka,et al.  Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in , 2007, Electron. Colloquium Comput. Complex..

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

[11]  Ilya Volkovich,et al.  On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors , 2010, ICALP.

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

[13]  Zeev Dvir,et al.  Hardness-randomness tradeoffs for bounded depth arithmetic circuits , 2008, SIAM J. Comput..

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

[15]  Vikraman Arvind,et al.  The Monomial Ideal Membership Problem and Polynomial Identity Testing , 2007, ISAAC.

[16]  Nitin Saxena,et al.  Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter , 2010, STOC '11.

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

[18]  Ran Raz,et al.  A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[19]  Ran Raz,et al.  Multi-linear formulas for permanent and determinant are of super-polynomial size , 2004, STOC '04.

[20]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[21]  Fan Chung Graham,et al.  Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.

[22]  Ilya Volkovich,et al.  Improved Polynomial Identity Testing for Read-Once Formulas , 2009, APPROX-RANDOM.

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

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

[25]  Patrizia Gianni,et al.  Symbolic and Algebraic Computation , 1988, Lecture Notes in Computer Science.

[26]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[27]  Nisheeth K. Vishnoi,et al.  Deterministic identity testing for multivariate polynomials , 2003, SODA '03.

[28]  Ran Raz,et al.  Separation of Multilinear Circuit and Formula Size , 2006, Theory Comput..

[29]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

[30]  A. Shamir.  IP=PSPACE (interactive proof=polynomial space) , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[31]  Ilya Volkovich,et al.  Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in , 2010, STOC '10.

[32]  Michael Ben-Or,et al.  A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.

[33]  Noga Alon.  Combinatorial Nullstellensatz , 1999, Combinatorics, Probability and Computing.

[34]  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.

[35]  M. Ben-Or,et al.  A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) , 1988, Symposium on the Theory of Computing.

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

[37]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[38]  Nitin Saxena,et al.  Diagonal Circuit Identity Testing and Lower Bounds , 2008, ICALP.

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

[40]  Nitin Saxena,et al.  An Almost Optimal Rank Bound for Depth-3 Identities , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[41]  Ilya Volkovich,et al.  Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[42]  E. W. Ng.  Symbolic and Algebraic Computation , 1979, Lecture Notes in Computer Science.

[43]  László Lovász,et al.  On determinants, matchings, and random algorithms , 1979, International Symposium on Fundamentals of Computation Theory.

[44]  Ran Raz,et al.  Lower Bounds and Separations for Constant Depth Multilinear Circuits , 2008, Computational Complexity Conference.

[45]  Joos Heintz,et al.  Testing polynomials which are easy to compute (Extended Abstract) , 1980, STOC '80.

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