Bipartite perfect matching in pseudo-deterministic NC (Q5111418)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bipartite perfect matching in pseudo-deterministic NC |
scientific article; zbMATH DE number 7204539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipartite perfect matching in pseudo-deterministic NC |
scientific article; zbMATH DE number 7204539 |
Statements
27 May 2020
0 references
parallel algorithms
0 references
pseudo-determinism
0 references
RNC
0 references
perfect matching
0 references
Bipartite Perfect Matching in Pseudo-Deterministic NC (English)
0 references
0.8130064010620117
0 references
0.8129567503929138
0 references
0.8124285936355591
0 references
0.803456723690033
0 references
0.8026940822601318
0 references
