The following pages link to Rohit Gurjar (Q1686833):
Displaying 22 items.
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Linear matroid intersection is in quasi-NC (Q2027206) (← links)
- Planarizing Gadgets for Perfect Matching Do Not Exist (Q2912747) (← links)
- (Q4601835) (← links)
- Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs (Q4601861) (← links)
- Planarizing Gadgets for Perfect Matching Do Not Exist (Q4973859) (← links)
- Exact Perfect Matching in Complete Graphs (Q4973885) (← links)
- Linear matroid intersection is in quasi-NC (Q4978026) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- (Q5002753) (← links)
- On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) (Q5009328) (← links)
- Pseudorandom Bits for Oblivious Branching Programs (Q5053059) (← links)
- The Complexity of Poset Games (Q5084701) (← links)
- On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) (Q5236236) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Bipartite perfect matching is in quasi-NC (Q5361877) (← links)
- (Q5368763) (← links)
- Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs (Q5368905) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
- (Q6070384) (← links)
- Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)
- A deterministic parallel reduction from weighted matroid intersection search to decision (Q6130320) (← links)
