An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance (Q4907584): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Changed label, description and/or aliases in en, and other parts
description / endescription / en
scientific article; zbMATH DE number 6134262

Revision as of 16:09, 2 May 2024

No description defined
Language Label Description Also known as
English
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
No description defined

    Statements

    An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance (English)
    0 references
    0 references
    0 references
    0 references
    4 February 2013
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references