Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems

Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis. Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems. TOCT, 7(3):10, 2015. [doi]

Abstract

Abstract is missing.