31 citations · 82 across the 22 of their papers we have counts for
Showing 2014 · cs.CCShow all
3 papers · 2 filters
cs.CC2014
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…
cs.CC2014★ 1 cited
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…
cs.CC2014
Progress on Polynomial Identity Testing - II
Nitin Saxena
We survey the area of algebraic complexity theory; with the focus being on the problem of polynomial identity testing (PIT). We discuss the key ideas that have gone into the result…