R. Gurjar

activity

20122026

most citedIdentity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs

9 citations · 13 across the 9 of their papers we have counts for

collaborators

Showing 2014 · cs.CCShow all

3 papers · 2 filters

cs.CC2014★ 1 cited

Derandomizing Isolation Lemma for $K_{3, 3}$ -free and $K_{5}$ -free Bipartite Graphs

Rahul Arora, Ashu Gupta, Rohit Gurjar +1

The perfect matching problem has a randomized NC algorithm, using the celebrated Isolation Lemma of Mulmuley, Vazirani and Vazirani. The Isolation Lemma states that giving a random…

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 $n^{O (l o g n)}$ -time ( $n$ is the input size) blackbox polynomial identity testing algorithm for unknown-order read-once oblivious algebraic branching programs (ROABP). Th…

Derandomizing Isolation Lemma for K3,3​-free and K5​-free Bipartite Graphs

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

Hitting-sets for ROABP and Sum of Set-Multilinear circuits

Derandomizing Isolation Lemma for $K_{3, 3}$ -free and $K_{5}$ -free Bipartite Graphs