Linear Matroid Intersection is in Quasi-NC

Given two matroids on the same ground set, the matroid intersection problem asks to find a common independent set of maximum size. In case of linear matroids, the problem had a randomized parallel algorithm but no deterministic one. We give an almost complete derandomization of this algorithm, which...

Full description

Bibliographic Details

Published in:	Computational complexity Vol. 29; no. 2
Main Authors:	Gurjar, Rohit, Thierauf, Thomas
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.12.2020
Subjects:	Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis Computer Science 68W20 05B35 90C57 Matroid Intersection Polynomial Identity Testing 68W10 Isolation Lemma Derandomization
ISSN:	1016-3328, 1420-8954
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!