An optimal lower bound on the communication complexity of gap-Hamming-distance (Q6829618)
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 6134262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal lower bound on the communication complexity of gap-Hamming-distance |
scientific article; zbMATH DE number 6134262 |
Statements
An optimal lower bound on the communication complexity of gap-Hamming-distance (English)
0 references
4 February 2013
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
