Linear Matroid Intersection is in Quasi-NC
- 19 November 2020
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 29 (2) , 1-42
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Deterministic Polynomial Time Algorithms for Matrix Completion ProblemsSIAM Journal on Computing, 2010
- Matroid Partition2009
- Proving Lower Bounds Via Pseudo-random Generators2005
- Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning TreesSIAM Journal on Computing, 1994
- Singular spaces of matrices and their application in combinatoricsBulletin of the Brazilian Mathematical Society, New Series, 1989
- Matching is as easy as matrix inversionCombinatorica, 1987
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- Fast Parallel Computation of Polynomials Using Few ProcessorsSIAM Journal on Computing, 1983
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- A probabilistic remark on algebraic program testingInformation Processing Letters, 1978