An optimal lower bound on the communication complexity of gap-hamming-distance

@inproceedings{Chakrabarti2011AnOL,
  title={An optimal lower bound on the communication complexity of gap-hamming-distance},
  author={Amit Chakrabarti and Oded Regev},
  booktitle={STOC '11},
  year={2011}
}
  • Amit Chakrabarti, Oded Regev
  • Published in STOC '11 2011
  • Computer Science, Mathematics
  • We prove an optimal Ω(n) lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model for a number of fundamental problems, including the estimation of frequency moments. The Gap-Hamming-Distance problem is a communication problem, wherein Alice and Bob receive n-bit strings x and y, respectively. They are promised that the Hamming distance between… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 28 CITATIONS, ESTIMATED 99% COVERAGE

    Information Lower Bounds via Self-Reducibility

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem

    • Thomas Vidick
    • Computer Science, Mathematics
    • Chic. J. Theor. Comput. Sci.
    • 2012
    VIEW 5 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Non-Interactive Proofs of Proximity

    Time Bounds for Streaming Problems

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Non-interactive proofs of proximity

    Sketching and Embedding are Equivalent for Norms

    VIEW 1 EXCERPT
    CITES METHODS

    FILTER CITATIONS BY YEAR

    2010
    2020

    CITATION STATISTICS

    • 4 Highly Influenced Citations

    References

    Publications referenced by this paper.

    Exponential separation of quantum and classical communication complexity

    • Ran Raz
    • Computer Science
    • STOC '99
    • 1999
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL