An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

Amit Chakrabarti, Oded Regev. An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance. SIAM Journal on Computing, 41(5):1299-1317, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.