Bipartite perfect matching is in quasi-NC (Q5361877)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6784116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipartite perfect matching is in quasi-NC |
scientific article; zbMATH DE number 6784116 |
Statements
Bipartite perfect matching is in quasi-NC (English)
0 references
29 September 2017
0 references
derandomization
0 references
graph matching
0 references
parallel complexity
0 references
quasi-NC
0 references
0.999829113483429
0 references
0.8356707692146301
0 references
0.8269038796424866
0 references
0.8232718110084534
0 references
0.8230716586112976
0 references
