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

DOI10.1007/11940128_63zbMath1135.68428OpenAlexW1608861503MaRDI QIDQ5459157

Aravind Srinivasan, Andrey Utis, William I. Gasarch, Andris Ambainis

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_63

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems