Skip to main content

Applications in Communication Complexity

  • Chapter
Extremal Combinatorics

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

  • 5527 Accesses

Abstract

Communication complexity is a basic part of the theory of computational complexity. We have k players who wish to collaboratively evaluate a given function f(x 1,…,x n ). The players have unlimited computational power but none of them has access to all inputs x 1,…,x n : each player can only see a part of them. The function f itself is known to all players. The players communicate by sending some bits of information about the inputs they can see. The communication complexity of f is then the minimal number of bits communicated on the worst-case input.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stasys Jukna .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jukna, S. (2011). Applications in Communication Complexity. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17364-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17364-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17363-9

  • Online ISBN: 978-3-642-17364-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics