1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2018
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)
Rohit Gurjar, Nisheeth K. Vishnoi
We show that for any regular matroid on elements and any , the number of -minimum circuits, or circuits whose size is at most an -multiple of the minimum size of…
cs.CC2017
Pseudorandom Bits for Oblivious Branching Programs
Rohit Gurjar, Ben Lee Volk
We construct a pseudorandom generator which fools read- oblivious branching programs and, more generally, any linear length oblivious branching program, assuming that the sequen…
cs.DM2017★ 1 cited
Extended Formulations for Polytopes of Regular Matroids
Rohit Gurjar, Nisheeth K. Vishnoi
We present a simple proof of the fact that the base (and independence) polytope of a rank regular matroid over elements has an extension complexity .