Hitting sets for multilinear read-once algebraic branching programs, in any order

We give deterministic black-box polynomial identity testing algorithms for multilinear read-once oblivious algebraic branching programs (ROABPs), in nO(log2 n) time. Further, our algorithm is oblivious to the order of the variables. This is the first sub-exponential time algorithm for this model. Furthermore, our result has no known analogue in the model of read-once oblivious boolean branching programs with unknown order. We obtain our results by recasting, and improving upon, the ideas of Agrawal, Saha and Saxena [ASS13]. We phrase the ideas in terms of rank condensers and Wronskians, and show that our results improve upon the classical multivariate Wronskian, which may be of independent interest. In addition, we give the first nO(lg lg n) black-box polynomial identity testing algorithm for the so called model of diagonal circuits. This result improves upon the nΘ(lg n)-time algorithms given by Agrawal, Saha and Saxena [ASS13], and Forbes and Shpilka [FS13b] for this class. More generally, our result holds for any model computing polynomials whose partial derivatives (of all orders) span a low dimensional linear space.

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

[2]  Vikraman Arvind,et al.  New Results on Noncommutative and Commutative Polynomial Identity Testing , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[3]  Anindya De,et al.  Pseudorandomness for Permutation and Regular Branching Programs , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[4]  Stanislav Zák,et al.  Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs , 2011, CSR.

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

[6]  Joshua Brody,et al.  The Coin Problem and Pseudorandomness for Branching Programs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[7]  Ran Raz,et al.  Deterministic extractors for affine sources over large fields , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[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]  Nitin Saxena,et al.  A Case of Depth-3 Identity Testing, Sparse Factorization and Duality , 2013, computational complexity.

[10]  Amir Shpilka,et al.  Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[11]  Amir Shpilka,et al.  Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing , 2013, APPROX-RANDOM.

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

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

[14]  Ran Raz,et al.  On recycling the randomness of states in space bounded computation , 1999, STOC '99.

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

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

[17]  Noam Nisan,et al.  Pseudorandomness for network algorithms , 1994, STOC '94.

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

[19]  Thomas Steinke.  Pseudorandomness for Permutation Branching Programs Without the Group Theory , 2012, Electron. Colloquium Comput. Complex..

[20]  Richard J. Lipton,et al.  A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..

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

[22]  Noam Nisan,et al.  Lower bounds for non-commutative computation , 1991, STOC '91.

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

[24]  Russell Impagliazzo,et al.  Pseudorandomness from Shrinkage , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[25]  Noam Nisan,et al.  Lower bounds on arithmetic circuits via partial derivatives , 2005, computational complexity.

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

[27]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[28]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[29]  Luca Trevisan,et al.  Better Pseudorandom Generators from Milder Pseudorandom Restrictions , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

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

[31]  Y. Tzur,et al.  Notions of Weak Pseudorandomness and GF (2 n )-Polynomials , 2009 .

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

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

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

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

[36]  Amir Shpilka,et al.  On identity testing of tensors, low-rank recovery and compressed sensing , 2011, STOC '12.

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

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

[39]  Nitin Saxena,et al.  Quasi-polynomial hitting-set for set-depth-Δ formulas , 2012, STOC '13.

[40]  Ketan Mulmuley,et al.  Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

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

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

[43]  Pavel Pudlák,et al.  Pseudorandom generators for group products: extended abstract , 2011, STOC '11.

[44]  Ran Raz,et al.  Deterministic polynomial identity testing in non-commutative models , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[45]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[46]  Periklis A. Papakonstantinou,et al.  Pseudorandomness for Read-Once Formulas , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

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

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

[50]  Thomas Steinke,et al.  Pseudorandomness for Regular Branching Programs via Fourier Analysis , 2013, APPROX-RANDOM.

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

[52]  Zeev Dvir,et al.  Pseudorandomness for Width-2 Branching Programs , 2013, Theory Comput..

[53]  Ran Raz,et al.  Pseudorandom Generators for Regular Branching Programs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

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

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

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

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