Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Taihei Oki:

TR24-044 | 28th February 2024
Rohit Gurjar, Taihei Oki, Roshan Raj

Fractional Linear Matroid Matching is in quasi-NC

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-polynomially many parallel processors. However, such a parallel algorithm is unknown for linear matroid matching, which generalizes both of these problems. In this work, we propose ... more >>>

ISSN 1433-8092 | Imprint