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. Electronic Colloquium on Computational Complexity (ECCC), 17:140, 2010. [doi]

Abstract

Abstract is missing.