Skip to main content
SpringerLink
Log in

Communication Complexity

  • Chapter
Complexity in Information Theory

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 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. 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. 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. 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. 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. 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. 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. 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. P. Erdös and J. Spencer, Probabilistic Methods in Combinatorics, Academic Press, 1974.

    MATH  Google Scholar 

  13. R. Freivalds, ‘Probabilistic machines can use less running time’, Information Processing, IFIP, North Holland, 1977, 839 – 842.

    Google Scholar 

  14. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publishing Company, 1984.

    Google Scholar 

  15. J. Ja’Ja’, ‘Identification is Easier than Decoding’, Proc. of the 26th Annual Symposium on Foundations of Computer Science, October 1985.

    Google Scholar 

  16. 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. 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. 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. 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. 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. A. Orlitsky and A. El Gamal, ‘Randomized Communication Complexity’, IEEE International Symposium on Information Theory, June 1985.

    Google Scholar 

  22. A. Orlitsky and A. El Gamal, ‘Average and Randomized Communication Complexity’, Submitted for Publication.

    Google Scholar 

  23. K.F. Pang and A. El Gamal, ‘Communication Complexity of Computing the Hamming Distance’, to appear, SIAM J. of Computing.

    Google Scholar 

  24. 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. H. Paturi and J. Simon, ‘Probabilistic Communication Complexity’, Proc. of the 25th Annual Symposium on Foundations of Computer Science, October 1984.

    Google Scholar 

  26. M.O. Rabin and A. Yao, unpublished manuscript (see [Yao 79]).

    Google Scholar 

  27. 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. C.E. Shannon, ‘A Mathematical Theory of Communication’, Bell Systems Technical Journal, July 1948.

    Google Scholar 

  29. D. Slepian and J.K. Wolf, ‘Noiseless Coding of Correlated Information Sources’, IEEE Transactions on Information Theory, July 1973.

    Google Scholar 

  30. 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. C.D. Thompson, ‘Area-Time Complexity for VLSI’, Proc. of the 11th Annual ACM Symposium on the Theory of Computing, 1979.

    Google Scholar 

  32. J.D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, Maryland, 1984.

    MATH  Google Scholar 

  33. 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. 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. 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. A.C. Yao, ‘Lower Bounds by Probabilistic Arguments’, Proceedings of the 24th Annual Symposium on Foundations of Computer Science, November 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Systems Laboratory Department of Electrical Engineering, Stanford University, Stanford, CA, 93405, USA

    A. Orlitsky & A. El Gamal

Authors
  1. A. Orlitsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. El Gamal
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Orlitsky, A., Gamal, A.E. (1998). Communication Complexity. In: Complexity in Information Theory. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3774-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-3774-7_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-8344-7

  • Online ISBN: 978-1-4612-3774-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation