An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance (Q4907584): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q375694 |
||
Property / author | |||
Property / author: Oded Regev / rank | |||
Revision as of 23:39, 13 February 2024
scientific article; zbMATH DE number 6134262
Language | Label | Description | Also known as |
---|---|---|---|
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