학술논문
BIPARTITE PERFECT MATCHING IS IN QUASI-NC.
Document Type
Article
Author
Source
Subject
*BIPARTITE graphs
*PARALLEL algorithms
*CIRCUIT complexity
*
*
Language
ISSN
0097-5397
Abstract
We show that the bipartite perfect matching problem is in quasi-NC². That is, it has uniform circuits of quasi-polynomial size nO(log n), and O(log² n) depth. Previously, only an exponential upper bound was known on the size of such circuits with poly-logarithmic depth. We obtain our result by an almost complete derandomization of the famous Isolation Lemma when applied to yield an efficient randomized parallel algorithm for the bipartite perfect matching problem. [ABSTRACT FROM AUTHOR]