On the Robust Communication Complexity of Bipartite Matching (Q6070391)
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: On the Robust Communication Complexity of Bipartite Matching |
scientific article; zbMATH DE number 7768393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Robust Communication Complexity of Bipartite Matching |
scientific article; zbMATH DE number 7768393 |
Statements
20 November 2023
0 references
maximum matching
0 references
communication complexity
0 references
random-order streaming
0 references
On the Robust Communication Complexity of Bipartite Matching (English)
0 references
