$58.99
Availability: 31 left in stock

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...

  • Name : Communication Complexity: And Applications
  • Vendor : Cambridge University Press
  • Type : Books
  • Manufacturing : 2024 / 08 / 01
  • Barcode : 9781108497985
Categories:

Guaranteed safe checkout:

apple paygoogle paymasterpaypalshopify payvisa
Communication Complexity: And Applications
- +
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.

Author: Anup Rao, Amir Yehudayoff
Binding Type: Hardcover
Publisher: Cambridge University Press
Published: 03/26/2020
Pages: 266
Weight: 1.4lbs
Size: 10.10h x 7.70w x 0.70d
ISBN: 9781108497985


Review Citation(s):
Choice 11/01/2021

About the Author
Rao, Anup: - 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.Yehudayoff, Amir: - "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."

Ezra's Archive Does not ship outside of the United States

Delivery Options:

1. Economy: 

Estimated Delivery Time - 5 to 8 Business Days

Shipping Cost - $4.15

2. USPS Priority:

Estimated Delivery Time - 1 to 3 Business Days 

Shipping Cost - $8.85

3. Free Economy Shipping: Only Applicable to Orders over $60

Returns and Refunds: 

Purchased items are not eligible to be returned. However, a refund or item replacement may be granted should an item be damaged or misplaced during shipping. To make a refund or replacement claim please contact us via email at Ezra'sArchive@outlook.com