12 citations · 15 across the 15 of their papers we have counts for
1 paper · 2 filters
Rohit Gurjar, Taihei Oki, Roshan Raj
The matching and linear matroid intersection problems are solvable in quasi-NC, meaning that there exist deterministic algorithms that run in polylogarithmic time and use quasi-pol…