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

被引：7

作者：

Anderson, Matthew ^{[1
]}

Forbes, Michael A. ^{[2
]}

Saptharishi, Ramprasad ^{[3
]}

Shpilka, Amir ^{[3
]}

Volk, Ben Lee ^{[3
]}

机构：

[1] Union Coll, Dept Comp Sci, Schenectady, NY 12308 USA

[2] Princeton Univ, Dept Comp Sci, Princeton, NJ 08544 USA

[3] Tel Aviv Univ, Dept Comp Sci, Tel Aviv, Israel

来源：

31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016) | 2016年 / 50卷

关键词：

Algebraic Complexity; Lower Bounds; Derandomization; Polynomial Identity Testing; PSEUDORANDOM GENERATORS; ARITHMETIC CIRCUITS; DEPTH; 4; COMPUTATION; CHASM;

D O I：

10.4230/LIPIcs.CCC.2016.30

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 (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 xsubexponential-time PIT algorithm. The algorithm runs in time 2 (1 1/2k-i) and needs white box access only to know the order in which the variables appear in the ABP.

引用

页数：25

共 28 条

[11] A quadratic lower bound for homogeneous algebraic branching programs
Kumar, Mrinal
COMPUTATIONAL COMPLEXITY, 2019, 28 (03) : 409 - 435
[12] A quadratic lower bound for homogeneous algebraic branching programs
Mrinal Kumar
computational complexity, 2019, 28 : 409 - 435
[13] Lower bounds for the sum of small-size algebraic branching programs
Bhargav, C.S.
Dwivedi, Prateek
Saxena, Nitin
Theoretical Computer Science, 2025, 1041
[14] Deterministic Black-Box Identity Testing π-Ordered Algebraic Branching Programs
Jansen, Maurice
Qiao, Youming
Sarma, Jayalal M. N.
IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 296 - 307
[15] Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits
Kayal, Neeraj
Nair, Vineet
Saha, Chandan
ACM TRANSACTIONS ON COMPUTATION THEORY, 2020, 12 (01)
[16] Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits
Kayal, Neeraj
Nair, Vineet
Saha, Chandan
33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
[17] A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs
Kumar, Mrinal
32ND COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2017), 2017, 79
[18] Hitting Sets for Multilinear Read-Once Algebraic Branching Programs, in any Order
Forbes, Michael A.
Saptharishi, Ramprasad
Shpilka, Amir
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 867 - 875
[19] Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs
Mahajan, Meena
Rao, B. V. Raghavendra
Sreenivasaiah, Karteek
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 655 - 667
[20] A read-once lower bound and a (1,+k)-hierarchy for branching programs
Savicky, P
Zák, S
THEORETICAL COMPUTER SCIENCE, 2000, 238 (1-2) : 347 - 362

← 1 2 3 →