Bipartite perfect matching is in quasi-NC. Zbl 1373.68267
Fenner, Stephen; Gurjar, Rohit; Thierauf, Thomas |
|
2016
|
Hitting-sets for ROABP and sum of set-multilinear circuits. Zbl 1327.68339
Agrawal, Manindra; Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin |
|
2015
|
Linear matroid intersection is in quasi-NC. Zbl 1370.68325
Gurjar, Rohit; Thierauf, Thomas |
|
2017
|
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs. Zbl 1388.68118
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin; Thierauf, Thomas |
|
2015
|
Identity testing for constant-width, and any-order, read-once oblivious arithmetic branching programs. Zbl 1378.68080
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin |
|
2017
|
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs. Zbl 1382.68110
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin; Thierauf, Thomas |
|
2017
|
Bipartite perfect matching is in quasi-NC. Zbl 1464.68126
Fenner, Stephen; Gurjar, Rohit; Thierauf, Thomas |
|
2021
|
Derandomizing isolation lemma for \(K_{3,3}\)-free and \(K_5\)-free bipartite graphs. Zbl 1388.68208
Arora, Rahul; Gupta, Ashu; Gurjar, Rohit; Tewari, Raghunath |
|
2016
|
Exact perfect matching in complete graphs. Zbl 1427.68243
Gurjar, Rohit; Korwar, Arpita; Messner, Jochen; Thierauf, Thomas |
|
2017
|
Isolating a vertex via lattices: polytopes with totally unimodular faces. Zbl 1499.68367
Gurjar, Rohit; Thierauf, Thomas; Vishnoi, Nisheeth K. |
|
2021
|
Planarizing gadgets for perfect matching do not exist. Zbl 1365.05280
Gurjar, Rohit; Korwar, Arpita; Messner, Jochen; Straub, Simon; Thierauf, Thomas |
|
2012
|
Identity testing for constant-width, and commutative, read-once oblivious ABPs. Zbl 1380.68224
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin |
|
2016
|
On the number of circuits in regular matroids (with connections to lattices and codes). Zbl 1434.05032
Gurjar, Rohit; Vishnoi, Nisheeth K. |
|
2019
|
Improved explicit hitting-sets for ROABPs. Zbl 07758306
Guo, Zeyu; Gurjar, Rohit |
|
2020
|
Isolating a vertex via lattices: polytopes with totally unimodular faces. Zbl 1499.68368
Gurjar, Rohit; Thierauf, Thomas; Vishnoi, Nisheeth K. |
|
2018
|
Linear matroid intersection is in quasi-NC. Zbl 1468.90150
Gurjar, Rohit; Thierauf, Thomas |
|
2020
|
Matroid intersection: a pseudo-deterministic parallel reduction from search to weighted-decision. Zbl 07768386
Ghosh, Sumanta; Gurjar, Rohit |
|
2021
|
A deterministic parallel reduction from weighted matroid intersection search to decision. Zbl 07883625
Ghosh, Sumanta; Gurjar, Rohit; Raj, Roshan |
|
2021
|
Bipartite perfect matching is in quasi-NC. Zbl 1464.68126
Fenner, Stephen; Gurjar, Rohit; Thierauf, Thomas |
|
2021
|
Isolating a vertex via lattices: polytopes with totally unimodular faces. Zbl 1499.68367
Gurjar, Rohit; Thierauf, Thomas; Vishnoi, Nisheeth K. |
|
2021
|
Matroid intersection: a pseudo-deterministic parallel reduction from search to weighted-decision. Zbl 07768386
Ghosh, Sumanta; Gurjar, Rohit |
|
2021
|
A deterministic parallel reduction from weighted matroid intersection search to decision. Zbl 07883625
Ghosh, Sumanta; Gurjar, Rohit; Raj, Roshan |
|
2021
|
Improved explicit hitting-sets for ROABPs. Zbl 07758306
Guo, Zeyu; Gurjar, Rohit |
|
2020
|
Linear matroid intersection is in quasi-NC. Zbl 1468.90150
Gurjar, Rohit; Thierauf, Thomas |
|
2020
|
On the number of circuits in regular matroids (with connections to lattices and codes). Zbl 1434.05032
Gurjar, Rohit; Vishnoi, Nisheeth K. |
|
2019
|
Isolating a vertex via lattices: polytopes with totally unimodular faces. Zbl 1499.68368
Gurjar, Rohit; Thierauf, Thomas; Vishnoi, Nisheeth K. |
|
2018
|
Linear matroid intersection is in quasi-NC. Zbl 1370.68325
Gurjar, Rohit; Thierauf, Thomas |
|
2017
|
Identity testing for constant-width, and any-order, read-once oblivious arithmetic branching programs. Zbl 1378.68080
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin |
|
2017
|
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs. Zbl 1382.68110
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin; Thierauf, Thomas |
|
2017
|
Exact perfect matching in complete graphs. Zbl 1427.68243
Gurjar, Rohit; Korwar, Arpita; Messner, Jochen; Thierauf, Thomas |
|
2017
|
Bipartite perfect matching is in quasi-NC. Zbl 1373.68267
Fenner, Stephen; Gurjar, Rohit; Thierauf, Thomas |
|
2016
|
Derandomizing isolation lemma for \(K_{3,3}\)-free and \(K_5\)-free bipartite graphs. Zbl 1388.68208
Arora, Rahul; Gupta, Ashu; Gurjar, Rohit; Tewari, Raghunath |
|
2016
|
Identity testing for constant-width, and commutative, read-once oblivious ABPs. Zbl 1380.68224
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin |
|
2016
|
Hitting-sets for ROABP and sum of set-multilinear circuits. Zbl 1327.68339
Agrawal, Manindra; Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin |
|
2015
|
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs. Zbl 1388.68118
Gurjar, Rohit; Korwar, Arpita; Saxena, Nitin; Thierauf, Thomas |
|
2015
|
Planarizing gadgets for perfect matching do not exist. Zbl 1365.05280
Gurjar, Rohit; Korwar, Arpita; Messner, Jochen; Straub, Simon; Thierauf, Thomas |
|
2012
|