The communication complexity of the Hamming distance problem

Information Processing Letters

Volumn 99, Issue 4, 2006, Pages 149-153

  Huang, Wei ^a   Shi, Yaoyun ^a   Zhang, Shengyu ^b   Zhu, Yufan ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b Princeton University   (United States)

Author keywords

Communication complexity; Computational complexity; Hamming distance

Indexed keywords

BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; NETWORK PROTOCOLS; PROBLEM SOLVING; RANDOM PROCESSES;

COMMUNICATION COMPLEXITY; HAMMING DISTANCE PROBLEM; QUANTUM FINGERPRINTING; QUANTUM LOWER BOUND;

COMMUNICATION SYSTEMS;

EID: 33744552500     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.01.014     Document Type: Article

References (19)

1. S. Aaronson, A. Ambainis, Quantum search of spatial regions, in: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 200-209
2. Ambainis A. Communication complexity in a 3-computer model. Algorithmica 16 3 (1996) 298-301
3. Ambainis A., Gasarch W., Srinavasan A., and Utis A. Lower bounds on the deterministic and quantum communication complexity of hamming distance (2004). cs.CC/0411076
4. Bar-Yossef Z., Jayram T.S., Kumar R., and Sivakumar D. Information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences 68 4 (2004) 702-732
5. L. Babai, P.G. Kimmel, Randomized simultaneous messages: solution of a problem of Yao in communication complexity, in: Proceedings of the 12th Annual IEEE Conference on Computational Complexity, 1997, pp. 239-246
6. G. Brassard, P. Høyer, A. Tapp, Quantum counting, in: Proceedings of 25th International Colloquium on Automata, Languages and Programming, 1998
7. Buhrman H., Cleve R., Watrous J., and de Wolf R. Quantum fingerprinting. Physical Review Letters 87 16 (2001)
8. H. Buhrman, R. Cleve, A. Wigderson, Quantum vs. classical communication and computation, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 63-68
9. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M.J. Strauss, R.N. Wright, Secure multiparty computation of approximations, in: Proceedings of 28th International Colloquium on Automata, Languages and Programming, 2001
10. Gavinsky D., Kempe J., and de Wolf R. Quantum communication cannot simulate a public coin (2004). quant-ph/0411051
11. Kalyanasundaram B., and Schnitger G. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics 5 4 (1992) 545-557
12. Kushilevitz E., and Nisan N. Communication Complexity (1997), Cambridge University Press, Cambridge
13. Newman I. Private vs. common random bits in communication complexity. Information Processing Letters 39 2 (1991) 67-71
14. I. Newman, M. Szegedy, Public vs. private coin flips in one round communication games, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 561-570
15. Razborov A.A. Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica 10 1 (1990) 81-93
16. Razborov A.A. Quantum communication complexity of symmetric predicates. Izvestiya Math. 67 1 (2003) 145-159. (English version); also in: quant-ph/0204025
17. A.C.-C. Yao, Some complexity questions related to distributive computing, in: Proceedings of the 11th Annual ACM Symposium on Theory of Computing, 1979, pp. 209-213
18. A.C.-C. Yao, Quantum circuit complexity, in: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, 1993, pp. 352-361
19. A.C.-C. Yao, On the power of quantum fingerprinting, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 77-81