A tight unconditional lower bound on distributed randomwalk computation (Q2943404)
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 6481668
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight unconditional lower bound on distributed randomwalk computation |
scientific article; zbMATH DE number 6481668 |
Statements
A tight unconditional lower bound on distributed randomwalk computation (English)
0 references
11 September 2015
0 references
communication complexity
0 references
distributed algorithms
0 references
lower bound
0 references
random walk
0 references
time complexity
0 references
0 references
0 references
0.8534476161003113
0 references
0.8475795984268188
0 references
0.8450677394866943
0 references
0.7873557209968567
0 references
0.7742070555686951
0 references
