Nearly optimal communication and query complexity of bipartite matching (Q6942974)
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 8080003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly optimal communication and query complexity of bipartite matching |
scientific article; zbMATH DE number 8080003 |
Statements
Nearly optimal communication and query complexity of bipartite matching (English)
0 references
15 August 2025
0 references
