Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

139

Voted

TOC
2008

71views more TOC 2008»

The One-Way Communication Complexity of Hamming Distance

15 years 2 months ago

The One-Way Communication Complexity of Hamming Distance

Download www.theoryofcomputing.org

Abstract: Consider the following version of the Hamming distance problem for

T. S. Jayram, Ravi Kumar, D. Sivakumar

Real-time Traffic

Hamming Distance | Lower Bound | One-way Communication Complexity | TOC 2008 |

claim paper

Related Content

» Limitations of Quantum Advice and OneWay Communication

» The communication complexity of the Hamming distance problem

» An Optimal Lower Bound on the Communication Complexity of GapHammingDistance

» A MultiRound Communication Lower Bound for Gap Hamming and Some Consequences

» Communication complexity of document exchange

» A GrayCode Type Bit Assignment Algorithm for Unitary SpaceTime Constellations

» Quantum Communication Cannot Simulate a Public Coin

» Optimal space lower bounds for all frequency moments

» Optimal Broadcasting in Injured Hypercubes Using Directed Safety Levels

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TOC
Authors	T. S. Jayram, Ravi Kumar, D. Sivakumar

Comments (0)