Lower bounds for the majority communication complexity of various graph accessibility problems (Q4717056)
From MaRDI portal
scientific article; zbMATH DE number 951911
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for the majority communication complexity of various graph accessibility problems |
scientific article; zbMATH DE number 951911 |
Statements
Lower bounds for the majority communication complexity of various graph accessibility problems (English)
0 references
1 December 1996
0 references
probabilistic communication complexity
0 references
graph accessibility problem
0 references
