Communication Complexity

  • A. Orlitsky
  • A. El Gamal

Abstract

The communication complexity of a function \(f:\{ 0, \cdots ,n - 1\} x\{ 0, \cdots ,n - 1\} \to \{ 0,1\}\) is the number of bits two persons have to exchange in order to determine f (x,y) when, initially, one person knows x and the other knows y.
  • • worst case / average,

  • • deterministic / randomized,

  • • error free / ∈-error allowed.

Keywords

Entropy Prefix Summing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ab 78]
    H. Abelson, ‘Lower Bounds on Information Transfer in Distributed Computations’, Proc. of the 19th Annual Symposium on Foundations of Computer Science, 1978.Google Scholar
  2. [AC 81]
    R. Ahlswede and I. Csiszár, ‘To Get a Bit of Information May be as Hard as to Get Full Information’, IEEE Transactions on Information Theory, Volume 27, No. 4, July 1981.Google Scholar
  3. [AUY 83]
    A.V. Aho, J.D. Ullman, and M. Yanakakis, ‘On notions of information transfer in VLSI circuits’, Proc. of the 15th Annual ACM Symposium on the Theory of Computing, April 1983.Google Scholar
  4. [AFR 85]
    N. Alon, P. Frankl, and V. Rödl, ‘Geometrical Realization of Set Systems and Probabilistic Communication Complexity’, Proc. of the 26th Annual Symposium on Foundations of Computer Science, October 1985.Google Scholar
  5. [BFS 86]
    L. Babai, P. Frankl, and J. Simon, ‘BPP and the Polynomial Time Hierarchy in Communication Complexity’, University of Chicago Technical Report 86-003, February 1986.Google Scholar
  6. [BOH 86]
    Y. Brandman, A. Orlitsky, and J. Hennessy, ‘A Universal Lower-Bound Technique for Decision Trees and Two-Level AND/OR Implementations of Boolean Functions’, to appear.Google Scholar
  7. CFL 83]
    A. Chandra, M. Furst, and R. Lipton, ‘Multi-Party Protocols’, Proc. of the 15th Annual ACM Symposium on the Theory of Computing, April 1983.Google Scholar
  8. [CG 85]
    B. Chor, and O. Goldreich, ‘Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity’, Proc. of the 26th Annual Symposium on Foundations of Computer Science, October 1985.Google Scholar
  9. [DGS 84]
    P. Duris, Z. Galil, and G. Schnitger, ‘Lower Bounds on Communication Complexity’, Proc. of the 16th Annual ACM Symposium on the Theory of Computing, 1984.Google Scholar
  10. [EIG 83]
    A. El Gamal, ‘A Simple proof of the Ahlswede-Csiszár One-Bit Theorem’ IEEE Transactions on Information Theory, Volume 29, No. 6, November 1983.Google Scholar
  11. [EO 84]
    A. El Gamal and A. Orlitsky, ‘Interactive Data Compression’, Proc. of the 25th Annual Symposium on Foundations of Computer Science, October 1984.Google Scholar
  12. [ES 74]
    P. Erdös and J. Spencer, Probabilistic Methods in Combinatorics, Academic Press, 1974.MATHGoogle Scholar
  13. [Fr 77]
    R. Freivalds, ‘Probabilistic machines can use less running time’, Information Processing, IFIP, North Holland, 1977, 839 – 842.Google Scholar
  14. [HU 79]
    J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publishing Company, 1984.Google Scholar
  15. [Ja 85]
    J. Ja’Ja’, ‘Identification is Easier than Decoding’, Proc. of the 26th Annual Symposium on Foundations of Computer Science, October 1985.Google Scholar
  16. [JK 84]
    J. J.’Ja’ and V.K.P. Kumar, ‘Information Transfer in Distributed Computing with applications to VLSI’, JACM, vol. 31, no. 1, January 1984.Google Scholar
  17. [JKS 84]
    J. Ja’Ja’, V.K.P. Kumar, and J. Simon, ‘Information Transfer Under Different Sets of Protocols’, SIAM Journal of Computing, Vol. 13 No. 4, November 1984.Google Scholar
  18. [LS 81]
    R.J. Lipton and R. Sedgewick, ‘Lower bounds for VLSI’, Proc. of the 13th Annual ACM Symposium on the Theory of Computing, April 1981.Google Scholar
  19. [MS 82]
    K. Mehlhorn and E.M. Schmidt, ‘Las Vegas is better then Determinism in VLSI and Distributed Computing’, Proc. of the 14th Annual ACM Symposium on the Theory of Computing, April 1982.Google Scholar
  20. [OE 84]
    A. Orlitsky and A. El Gamal, ‘Communication with Secrecy Constraints’ Proc. of the 16th Annual ACM Symposium on the Theory of Computing, April 1984.Google Scholar
  21. [OE 85]
    A. Orlitsky and A. El Gamal, ‘Randomized Communication Complexity’, IEEE International Symposium on Information Theory, June 1985.Google Scholar
  22. [OE 86]
    A. Orlitsky and A. El Gamal, ‘Average and Randomized Communication Complexity’, Submitted for Publication.Google Scholar
  23. [PE 84]
    K.F. Pang and A. El Gamal, ‘Communication Complexity of Computing the Hamming Distance’, to appear, SIAM J. of Computing.Google Scholar
  24. [PpS 82]
    C.H. Papadimitriou and M. Sipser, ‘Coomunication Complexity’, Proc. of the 14th Annual ACM Symposium on the Theory of Computing, April 1982.Google Scholar
  25. [PtS 84]
    H. Paturi and J. Simon, ‘Probabilistic Communication Complexity’, Proc. of the 25th Annual Symposium on Foundations of Computer Science, October 1984.Google Scholar
  26. [RY 79]
    M.O. Rabin and A. Yao, unpublished manuscript (see [Yao 79]).Google Scholar
  27. [SV 84]
    M. Santha and U.V. Vazirani, ‘Generating Quasi-Random Sequences from Slightly Random Sources’, Proc. 25th Annual Symposium on Foundations of Computer Science, October 1984.Google Scholar
  28. [Sh 48]
    C.E. Shannon, ‘A Mathematical Theory of Communication’, Bell Systems Technical Journal, July 1948.Google Scholar
  29. [SW 73]
    D. Slepian and J.K. Wolf, ‘Noiseless Coding of Correlated Information Sources’, IEEE Transactions on Information Theory, July 1973.Google Scholar
  30. [Ti 84]
    P. Tiwari, ‘Lower Bounds on Communication Complexity in Distributed Computer Networks’, Proc. of the 25th Annual Symposium on Foundations of Computer Science, October 1984.Google Scholar
  31. [Th 80]
    C.D. Thompson, ‘Area-Time Complexity for VLSI’, Proc. of the 11th Annual ACM Symposium on the Theory of Computing, 1979.Google Scholar
  32. [Ul 84]
    J.D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, Maryland, 1984.MATHGoogle Scholar
  33. [Va 85]
    U.V. Vazirani, ‘Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-Random Sources’. Proc. of the 17th Annual ACM Symposium on the Theory of Computing, May 1985.Google Scholar
  34. [Yao 79]
    A.C. Yao, ‘Some Complexity Questions Related to Distributive Computing’, Proc. of the 11th Annual ACM Symposium on the Theory of Computing, 1979.Google Scholar
  35. [Yao 81]
    A.C. Yao, ‘The Entropic Limitations on VLSI Computation, Proc. of the 13th Annual ACM Symposium on the Theory of Computing, 1981.Google Scholar
  36. [Yao 83]
    A.C. Yao, ‘Lower Bounds by Probabilistic Arguments’, Proceedings of the 24th Annual Symposium on Foundations of Computer Science, November 1983.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1998

Authors and Affiliations

  • A. Orlitsky
    • 1
  • A. El Gamal
    • 1
  1. 1.Information Systems Laboratory Department of Electrical EngineeringStanford UniversityStanfordUSA

Personalised recommendations