On the complexity of distributed stable matching with small messages (Q660987)
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 complexity of distributed stable matching with small messages |
scientific article; zbMATH DE number 6003472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of distributed stable matching with small messages |
scientific article; zbMATH DE number 6003472 |
Statements
On the complexity of distributed stable matching with small messages (English)
0 references
6 February 2012
0 references
distributed complexity
0 references
stable matching problem
0 references
stable marriage
0 references
0.880001425743103
0 references
0.8790149688720703
0 references
0.8669189214706421
0 references
0.8555508852005005
0 references
0.8432967662811279
0 references
