Lower bounds for the majority communication complexity of various graph accessibility problems (Q3569020)
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: Lower bounds for the majority communication complexity of various graph accessibility problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for the majority communication complexity of various graph accessibility problems |
scientific article |
Statements
Lower bounds for the majority communication complexity of various graph accessibility problems (English)
0 references
17 June 2010
0 references
