9 citations · 11 across the 4 of their papers we have counts for
4 papers
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
Rohit Gurjar, Arpita Korwar, Nitin Saxena
We give improved hitting sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known order of the variables. T…
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs
Rohit Gurjar, Arpita Korwar, Nitin Saxena +1
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 ti…
Hitting-sets for ROABP and Sum of Set-Multilinear circuits
Manindra Agrawal, Rohit Gurjar, Arpita Korwar +1
We give a -time ( is the input size) blackbox polynomial identity testing algorithm for unknown-order read-once oblivious algebraic branching programs (ROABP). Th…
Hitting-sets for low-distance multilinear depth-3
Manindra Agrawal, Rohit Gurjar, Arpita Korwar +1
The depth- model has recently gained much importance, as it has become a stepping-stone to understanding general arithmetic circuits. Its restriction to multilinearity has known…