Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees

We study the class of non-commutative Unambiguous circuits or Unique-Parse-Tree (UPT) circuits, and a related model of Few-Parse-Trees (FewPT) circuits (which were recently introduced by Lagarde, Malod and Perifel [LMP16] and Lagarde, Limaye and Srinivasan [LLS17]) and give the following constructions: (1) An explicit hitting set of quasipolynomial size for UPT circuits, (2) An explicit hitting set of quasipolynomial size for FewPT circuits (circuits with constantly many parse tree shapes), (3) An explicit hitting set of polynomial size for UPT circuits (of known parse tree shape), when a parameter of preimage-width is bounded by a constant. The above three results are extensions of the results of [AGKS15], [GKST15] and [GKS16] to the setting of UPT circuits, and hence also generalize their results in the commutative world from read-once oblivious algebraic branching programs (ROABPs) to UPT-set-multilinear circuits. The main idea is to study shufflings of non-commutative polynomials, which can then be used to prove suitable depth reduction results for UPT circuits and thereby allow a careful translation of the ideas in [AGKS15], [GKST15] and [GKS16].

[1]  Manindra Agrawal,et al.  Primality and identity testing via Chinese remaindering , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

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

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

[5]  Vikraman Arvind,et al.  Some Lower Bound Results for Set-Multilinear Arithmetic Computations , 2016, Chic. J. Theor. Comput. Sci..

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

[7]  Amir Yehudayoff,et al.  On isoperimetric profiles and computational complexity , 2015, Electron. Colloquium Comput. Complex..

[8]  Nitin Saxena,et al.  Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits , 2014, SIAM J. Comput..

[9]  Walter Baur,et al.  The Complexity of Partial Derivatives , 1983, Theor. Comput. Sci..

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

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

[12]  Nitin Saxena,et al.  Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs , 2014, computational complexity.

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

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

[15]  Guillaume Lagarde,et al.  Non-commutative computations: lower bounds and polynomial identity testing , 2016, Electron. Colloquium Comput. Complex..

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

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

[18]  Adam R. Klivans,et al.  Learning Restricted Models of Arithmetic Circuits , 2006, Theory Comput..

[19]  Guillaume Lagarde,et al.  Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees , 2017, MFCS.

[20]  Nitin Saxena,et al.  Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs , 2016, Computational Complexity Conference.

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

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

[23]  Leslie G. Valiant,et al.  Completeness classes in algebra , 1979, STOC.

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

[25]  Avi Wigderson,et al.  Non-commutative circuits and the sum-of-squares problem , 2010, STOC '10.

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

[27]  Nutan Limaye,et al.  Lower Bounds for Non-Commutative Skew Circuits , 2016, Theory Comput..