Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR15-184 | 21st November 2015 22:21

Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs

RSS-Feed




TR15-184
Authors: Matthew Anderson, Michael Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Publication: 22nd November 2015 06:55
Downloads: 905
Keywords: 


Abstract:

Read-$k$ oblivious algebraic branching programs are a natural generalization of the well-studied model of read-once oblivious algebraic branching program (ROABPs).
In this work, we give an exponential lower bound of $\exp(n/k^{O(k)})$ on the width of any read-$k$ oblivious ABP computing some explicit multilinear polynomial $f$ that is computed by a polynomial size depth-$3$ circuit.
We also study the polynomial identity testing (PIT) problem for this model and obtain a white-box subexponential-time PIT algorithm.
The algorithm runs in time $2^{\tilde{O}(n^{1-1/2^{k-1}})}$ and needs white box access only to know the order in which the variables appear in the ABP.



ISSN 1433-8092 | Imprint