Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Basis isolation:
TR14-158 | 26th November 2014
Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf

Deterministic Identity Testing for Sum of Read Once ABPs

Revisions: 2

A read once ABP is an arithmetic branching program with each variable occurring 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, i.e. ... more >>>

ISSN 1433-8092 | Imprint