Lower Bounds for Special Cases of Syntactic Multilinear ABPs

Algebraic Branching Programs(ABPs) are standard models for computing polynomials. Syntactic multilinear ABPs (smABPs) are restrictions of ABPs where every variable is allowed to occur at most once in every path from the start to the terminal node. Proving lower bounds against syntactic multilinear ABPs remains a challenging open question in Algebraic Complexity Theory. The current best known bound is only quadratic [Alon-Kumar-Volk, ECCC 2017]. In this article we develop a new approach upper bounding the rank of the partial derivative matrix of syntactic multlinear ABPs: Convert the ABP to a syntactic mulilinear formula with a super polynomial blow up in the size and then exploit the structural limitations of resulting formula to obtain a rank upper bound. Using this approach, we prove exponential lower bounds for special cases of smABPs and circuits - namely sum of Oblivious Read-Once ABPs, r-pass mulitlinear ABPs and sparse ROABPs. En route, we also prove super-polynomial lower bound for a special class of syntactic multilinear arithmetic circuits.

[1]  Ramprasad Saptharishi,et al.  Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs , 2018, ACM Trans. Comput. Theory.

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

[3]  Ran Raz,et al.  Balancing Syntactically Multilinear Arithmetic Circuits , 2008, computational complexity.

[4]  Meena Mahajan,et al.  Sums of read-once formulas: How many summands are necessary? , 2018, Theor. Comput. Sci..

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

[6]  Neeraj Kayal,et al.  Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits , 2020, STACS.

[7]  Markus Lohrey,et al.  Circuits and Expressions over Finite Semirings , 2018, TOCT.

[8]  B. V. Raghavendra Rao,et al.  Sum of Products of Read-Once Formulas , 2016, FSTTCS.

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

[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]  N. Nisan.  Lower Bounds for Non-Commutative Computation (Extended Abstract) , 1991, STOC 1991.

[12]  Nutan Limaye,et al.  Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications , 2017, Electron. Colloquium Comput. Complex..

[13]  Maurice J. Jansen.  Lower Bounds for Syntactically Multilinear Algebraic Branching Programs , 2008, MFCS.

[14]  Kousha Etessami,et al.  Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.

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

[16]  Mrinal Kumar,et al.  An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits , 2017, Electron. Colloquium Comput. Complex..

[17]  Michael A. Forbes.  Polynomial identity testing of read-once oblivious algebraic branching programs , 2014 .

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