Better Gap-Hamming Lower Bounds via Better Round Elimination release_grtayendy5doxfbjgbczyp4syi

by Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf

Released as a article .

2009  

Abstract

Gap Hamming Distance is a well-studied problem in communication complexity, in which Alice and Bob have to decide whether the Hamming distance between their respective n-bit inputs is less than n/2-sqrt(n) or greater than n/2+sqrt(n). We show that every k-round bounded-error communication protocol for this problem sends a message of at least Omega(n/(k^2\log k)) bits. This lower bound has an exponentially better dependence on the number of rounds than the previous best bound, due to Brody and Chakrabarti. Our communication lower bound implies strong space lower bounds on algorithms for a number of data stream computations, such as approximating the number of distinct elements in a stream. Subsequent to this result, the bound has been improved by some of us to the optimal Omega(n), independent of k, by using different techniques.
In text/plain format

Archived Files and Locations

application/pdf  155.6 kB
file_pdzyhhll5rcarofnoyoepddgti
web.archive.org (webarchive)
cs.au.dk (web)
web.archive.org (webarchive)
www.cs.swarthmore.edu (web)
archive.org (archive)
+ 5 more URLs
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2009-12-30
Version   v1
Language   en ?
arXiv  0912.5276v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: ce86ef60-b9ca-4b0d-ad3d-7dfac9513dfa
API URL: JSON