An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance (Q4907584): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Merged Item from Q5419074 |
||||||||||||||
| aliases / en / 0 | aliases / en / 0 | ||||||||||||||
An optimal lower bound on the communication complexity of gap-hamming-distance | |||||||||||||||
| description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 6301128 | |||||||||||||||
| Property / title | |||||||||||||||
An optimal lower bound on the communication complexity of gap-hamming-distance (English) | |||||||||||||||
| Property / title: An optimal lower bound on the communication complexity of gap-hamming-distance (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Open document ID | |||||||||||||||
| Property / zbMATH Open document ID: 1288.90005 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / DOI | |||||||||||||||
| Property / DOI: 10.1145/1993636.1993644 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / published in | |||||||||||||||
| Property / published in: Proceedings of the forty-third annual ACM symposium on Theory of computing / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / publication date | |||||||||||||||
5 June 2014
| |||||||||||||||
| Property / publication date: 5 June 2014 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Mathematics Subject Classification ID | |||||||||||||||
| Property / Mathematics Subject Classification ID: 90B18 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Mathematics Subject Classification ID | |||||||||||||||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Mathematics Subject Classification ID | |||||||||||||||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Mathematics Subject Classification ID | |||||||||||||||
| Property / Mathematics Subject Classification ID: 94A17 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH DE Number | |||||||||||||||
| Property / zbMATH DE Number: 6301128 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
gaussian noise correlation | |||||||||||||||
| Property / zbMATH Keywords: gaussian noise correlation / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / OpenAlex ID | |||||||||||||||
| Property / OpenAlex ID: W1984126159 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Latest revision as of 10:20, 6 May 2024
scientific article; zbMATH DE number 6301128
- An optimal lower bound on the communication complexity of gap-hamming-distance
| 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
An optimal lower bound on the communication complexity of gap-hamming-distance (English)
0 references
4 February 2013
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
gaussian noise correlation
0 references
