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

Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis. Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. In Tetsuo Asano, editor, Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings. Volume 4288 of Lecture Notes in Computer Science, pages 628-637, Springer, 2006. [doi]

Abstract

Abstract is missing.