An optimal lower bound on the communication complexity of gap-hamming-distance (Q5419074)
From MaRDI portal
Item:Q5419074
scientific article; zbMATH DE number 6301128
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal lower bound on the communication complexity of gap-hamming-distance |
scientific article; zbMATH DE number 6301128 |
Statements
An optimal lower bound on the communication complexity of gap-hamming-distance (English)
0 references
5 June 2014
0 references
communication complexity
0 references
corruption
0 references
data streams
0 references
gap-Hamming-distance
0 references
gaussian noise correlation
0 references
lower bounds
0 references
