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...

Celý popis

Podrobná bibliografia

Vydané v:	Computational complexity Ročník 29; číslo 2
Hlavní autori:	Gurjar, Rohit, Thierauf, Thomas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.12.2020
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!