Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs

Rohit Gurjar; Arpita Korwar; Nitin Saxena; Thomas Thierauf

Home/Archive/arXiv

arXiv · 1411.7341

Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs

Rohit Gurjar·Arpita Korwar·Nitin Saxena·Thomas Thierauf

View original source ↗Read source document ↗Export metadata ↓

Abstract

A read-once oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly many ROABPs. We also give a corresponding blackbox algorithm with quasi-polynomial time complexity $n^{O(\log n)}$. In both the cases, our time complexity is double exponential in the number of ROABPs. ROABPs are a generalization of set-multilinear depth-$3$ circuits. The prior results for the sum of constantly many set-multilinear depth-$3$ circuits were only slightly better than brute-force, i.e. exponential-time. Our techniques are a new interplay of three concepts for ROABP: low evaluation dimension, basis isolating weight assignment and low-support rank concentration. We relate basis isolation to rank concentration and extend it to a sum of two ROABPs using evaluation dimension (or partial derivatives).

Explore related subjects

cs.CC

Keep this discovery

BibTeX RIS

Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf. 2014-11-26. Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. https://arxiv.org/abs/1411.7341

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗