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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Andris Ambainis' in GoogleThis author has not been identified. Look up 'William I. Gasarch' in GoogleThis author has not been identified. Look up 'Aravind Srinivasan' in GoogleThis author has not been identified. Look up 'Andrey Utis' in Google

runs on WebDSL