Communication Complexity, 9781108497985
Hardcover
Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal. This tutorial text explains fundamentals and recent developments in an accessible and illustrated form, including applications in circuit complexity, proof complexity, …

Communication Complexity

and applications

$169.97

  • Hardcover

    266 pages

  • Release Date

    20 February 2020

Check Delivery Options

Summary

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 resear…

Book Details

ISBN-13:9781108497985
ISBN-10:1108497985
Author:Anup Rao, Amir Yehudayoff
Publisher:Cambridge University Press
Imprint:Cambridge University Press
Format:Hardcover
Number of Pages:266
Release Date:20 February 2020
Weight:660g
Dimensions:259mm x 181mm x 19mm
What They're Saying

Critics Review

‘This looks like an essential resource for any student who wants to understand deterministic and randomized communication complexity deeply.’ Scott Aaronson, University of Texas

‘This looks like an essential resource for any student who wants to understand deterministic and randomized communication complexity deeply.’ Scott Aaronson, University of Texas‘Communication complexity is not only a beautiful and important area of the theory of computing, it is also vibrant and ever-changing. Two of the leading researchers in this area take us through a fascinating journey into the theory and applications of communication complexity and through old and new jams. I feel inspired to teach a course based on this book and help spread the word.’ Omer Reingold, Stanford University, California‘This book is a much-needed introductory text on communication complexity. It will bring the reader up to speed on both classical and more recent lower bound techniques, and on key application areas. An invaluable resource for anyone interested in complexity theory.’ Mark Braverman, Princeton University, New Jersey‘… a great book … relevant to advanced undergrads and graduate students alike, while the more advanced topics will also be of interest to researchers …’ Michael Cadilhac, SIGACT News Book review column‘… must-have reference for students but will be welcomed by researchers as well because it is so well-written and aptly organized … Highly recommended.’ A. Misseldine, CHOICE

About The Author

Anup Rao

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

Returns

This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.