Skip to main content
Springer Nature Link
Log in

Communication Complexity

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 275 Accesses

Years and Authors of Summarized Original Work

  • 1977; Yao

  • 1979; Yao

  • 1986; Babai, Frankl, Simon

  • 1991; Newman

  • 1992; Razborov

  • 1995; Feder, Kushilevitz, Naor, Nisan

  • 1997; Kushilevitz, Nisan

  • 1998; Miltersen, Nisan, Safra, Wigderson

  • 2001; Chakrabarti, Shi, Wirth, Yao

  • 2004; Bar-Yossef, Jayram, Kumar, Sivakumar

  • 2009; Lee, Shraibman

  • 2010; Barak, Braverman, Chen, Rao

  • 2010; Jain, Klauck

  • 2011; Braverman, Rao

  • 2012; Braverman

  • 2012; Chakrabarti, Regev

  • 2014; Brody, Chakrabarti, Kondapally, Woodruff, Yaroslavtsev

  • 2014; Ganor, Kol, Raz

  • 2014; Lovett

Problem Definition

Two players – Alice and Bob – are playing a game in which their shared goal is to compute a function \(f : \mathcal{X}\times \mathcal{Y}\rightarrow \mathcal{Z}\) efficiently. The game starts with Alice holding a value \(x \in \mathcal{X}\) and Bob holding \(y \in \mathcal{Y}\). They then communicate by sending each other messages according to a predetermined protocol, at the end of which they must both arrive at some output \(z \in...

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Alon N, Matias Y, Szegedy M (1999) The space complexity of approximating the frequency moments. J Comput Syst Sci 58(1):137–147. Preliminary version in Proceedings of the 28th annual ACM symposium on the theory of computing, 1996, pp 20–29

    Google Scholar 

  2. Babai L, Frankl P, Simon J (1986) Complexity classes in communication complexity theory. In: Proceedings of the 27th annual IEEE symposium on foundations of computer science, Toronto, pp 337–347

    Google Scholar 

  3. Barak B, Braverman M, Chen X, Rao A (2010) How to compress interactive communication. In: Proceedings of the 41st annual ACM symposium on the theory of computing, Cambridge, pp 67–76

    Google Scholar 

  4. Bar-Yossef Z, Jayram TS, Kumar R, Sivakumar D (2004) An information statistics approach to data stream and communication complexity. J Comput Syst Sci 68(4):702–732

    Article  MathSciNet  MATH  Google Scholar 

  5. Braverman M (2012) Interactive information complexity. In: Proceedings of the 44th annual ACM symposium on the theory of computing, New York, pp 505–524

    Google Scholar 

  6. Braverman M, Rao A (2011) Information equals amortized communication. In: Proceedings of the 52nd annual IEEE symposium on foundations of computer science, Palm Springs, pp 748–757

    Google Scholar 

  7. Brody J, Chakrabarti A, Kondapally R, Woodruff DP, Yaroslavtsev G (2014) Certifying equality with limited interaction. In: Proceedings of the 18th international workshop on randomization and approximation techniques in computer science, Barcelona, pp 545–581

    Google Scholar 

  8. Chakrabarti A, Regev O (2012) An optimal lower bound on the communication complexity of gap-hamming-distance. SIAM J Comput 41(5):1299–1317. Preliminary version in Proceedings of the 43rd annual ACM symposium on the theory of computing, 2011, pp 51–60

    Google Scholar 

  9. Chakrabarti A, Shi Y, Wirth A, Yao AC (2001) Informational complexity and the direct sum problem for simultaneous message complexity. In: Proceedings of the 42nd annual IEEE symposium on foundations of computer science, Las Vegas, pp 270–278

    Google Scholar 

  10. Feder T, Kushilevitz E, Naor M, Nisan N (1995) Amortized communication complexity. SIAM J Comput 24(4):736–750. Preliminary version in Proceedings of the 32nd annual IEEE symposium on foundations of computer science, 1991, pp 239–248

    Google Scholar 

  11. Ganor A, Kol G, Raz R (2014) Exponential separation of information and communication for boolean functions. Technical report TR14-113, ECCC

    Google Scholar 

  12. Jain R, Klauck H (2010) The partition bound for classical communication complexity and query complexity. In: Proceedings of the 25th annual IEEE conference on computational complexity, Cambridge, pp 247–258

    Google Scholar 

  13. Karchmer M, Wigderson A (1990) Monotone circuits for connectivity require super-logarithmic depth. SIAM J Discrete Math 3(2):255–265. Preliminary version in Proceedings of the 20th annual ACM symposium on the theory of computing, 1988, pp 539–550

    Google Scholar 

  14. Kushilevitz E, Nisan N (1997) Communication complexity. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  15. Lee T, Shraibman A (2009) Lower bounds in communication complexity. Found Trends Theor Comput Sci 3(4):263–399

    Article  MathSciNet  MATH  Google Scholar 

  16. Lovett S (2014) Communication is bounded by root of rank. In: Proceedings of the 46th annual ACM symposium on the theory of computing, New York, pp 842–846

    Google Scholar 

  17. Miltersen PB, Nisan N, Safra S, Wigderson A (1998) On data structures and asymmetric communication complexity. J Comput Syst Sci 57(1):37–49. Preliminary version in Proceedings of the 27th annual ACM symposium on the theory of computing, 1995, pp 103–111

    Google Scholar 

  18. Newman I (1991) Private vs. common random bits in communication complexity. Inf Process Lett 39(2):67–71

    Article  MathSciNet  MATH  Google Scholar 

  19. Pǎtraşcu M (2011) Unifying the landscape of cell-probe lower bounds. SIAM J Comput 40(3):827–847

    Article  MathSciNet  MATH  Google Scholar 

  20. Razborov A (1992) On the distributional complexity of disjointness. Theor Comput Sci 106(2):385–390. Preliminary version in Proceedings of the 17th international colloquium on automata, languages and programming, 1990, pp 249–253

    Google Scholar 

  21. Sherstov AA (2014) Communication lower bounds using directional derivatives. J. ACM 61:1–71. Preliminary version in Proceedings of the 45th annual ACM symposium on the theory of computing, 2013, pp 921–930

    Google Scholar 

  22. Yao AC (1977) Probabilistic computations: towards a unified measure of complexity. In: Proceedings of the 18th annual IEEE symposium on foundations of computer science, Providence, pp 222–227

    Google Scholar 

  23. Yao AC (1979) Some complexity questions related to distributive computing. In: Proceedings of the 11th annual ACM symposium on the theory of computing, Atlanta, pp 209–213

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Dartmouth College, Hanover, NH, USA

    Amit Chakrabarti

Authors
  1. Amit Chakrabarti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amit Chakrabarti .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Chakrabarti, A. (2016). Communication Complexity. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_799

Download citation

Publish with us

Policies and ethics