Communication Complexity: And Applications

Rao, Anup, Yehudayoff, Amir

  • 出版商: Cambridge
  • 出版日期: 2020-02-20
  • 售價: $1,920
  • 貴賓價: 9.5$1,824
  • 語言: 英文
  • 頁數: 266
  • 裝訂: Hardcover - also called cloth, retail trade, or trade
  • ISBN: 1108497985
  • ISBN-13: 9781108497985

下單後立即進貨 (約1週~2週)


Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. This introduction presents the most recent developments in an accessible form, providing the language to unify several disjoint research subareas. Written as a guide for a graduate course on communication complexity, it will interest a broad audience in computer science, from advanced undergraduates to researchers in areas ranging from theory to algorithm design to distributed computing. The first part presents basic theory in a clear and illustrative way, offering beginners an entry into the field. The second part describes applications including circuit complexity, proof complexity, streaming algorithms, extension complexity of polytopes, and distributed computing. Proofs throughout the text use ideas from a wide range of mathematics, including geometry, algebra, and probability. Each chapter contains numerous examples, figures, and exercises to aid understanding.

  • Offers a modern guide to a growing, interdisciplinary field
  • Includes numerous illustrations, examples, and end-of-chapter exercises
  • Comments and notes provide context and pointers to further reading


Anup RaoUniversity of Washington
Anup Rao is an Associate Professor at the School of Computer Science, University of Washington. He received his Ph.D. in Computer Science from the University of Texas, Austin, and was a researcher at the Institute for Advanced Study, Princeton. His research interests are primarily in theoretical computer science.

Amir YehudayoffTechnion - Israel Institute of Technology, Haifa
Amir Yehudayoff is Associate Professor of Mathematics at Technion – Israel Institute of Technology, Haifa. He is interested in mathematical questions that are motivated by theoretical computer science and machine learning. He was a member of the Institute for Advanced Study in Princeton, and served as the secretary of the Israel Mathematical Union. He has won several prizes, including the Cooper Prize and the Krill Prize for excellence in scientific research, and the Kurt Mahler Prize for excellence in mathematics.


Conventions and preliminaries
Part I. Communication:
1. Deterministic protocols
2. Rank
3. Randomized protocols
4. Numbers on foreheads
5. Discrepancy
6. Information
7. Compressing communication
8. Lifting
Part II. Applications:
9. Circuits and proofs
10. Memory size
11. Data structures
12. Extension Complexity of Polytopes
13. Distributed computing.