On lower bounds for the time and the bit complexity of some probabilistic distributed graph algorithms. Extended abstract (Q2938103)
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 6385919
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On lower bounds for the time and the bit complexity of some probabilistic distributed graph algorithms. Extended abstract |
scientific article; zbMATH DE number 6385919 |
Statements
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (English)
0 references
13 January 2015
0 references
0.8372489213943481
0 references
0.8119117021560669
0 references
0.8108888864517212
0 references
0.8080751299858093
0 references
0.8046180605888367
0 references
