Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic
  Branching Programs   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.

37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
30
The categories of this paper are: q-alg
27
The categories of this paper are: comp-gas
29
The categories of this paper are: funct-an
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
10
The categories of this paper are: q-bio
3
The categories of this paper are: physics
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
35
The categories of this paper are: mtrl-th