Ashu Gupta

most citedDerandomizing Isolation Lemma for

K_{3, 3}

-free and

K_{5}

-free Bipartite Graphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

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…

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

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