An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance (Q4907584): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985526537 / rank | |||
Normal rank | |||
Revision as of 02:39, 20 March 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
