@inproceedings{ace3def44d35491499d130de8e9ac864,
title = "Identity testing and lower bounds for read-k oblivious algebraic branching programs",
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/kO(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∼O(n1-1/2k-1 ) and needs white box access only to know the order in which the variables appear in the ABP.",
keywords = "Algebraic complexity, Derandomization, Lower bounds, Polynomial identity testing",
author = "Matthew Anderson and Forbes, {Michael A.} and Ramprasad Saptharishi and Amir Shpilka and Volk, {Ben Lee}",
note = "Publisher Copyright: {\textcopyright} Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi,Amir Shpilka, and Ben Lee Volk.; 31st Conference on Computational Complexity, CCC 2016 ; Conference date: 29-05-2016 Through 01-06-2016",
year = "2016",
month = may,
day = "1",
doi = "https://doi.org/10.4230/LIPIcs.CCC.2016.30",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
pages = "30:1--30:25",
editor = "Ran Raz",
booktitle = "31st Conference on Computational Complexity, CCC 2016",
}