We specialize in hard to find items
All Categories
Communication Complexity: and Applications
Share Tweet
*Price and Stocks may change without prior notice
*Packaging of actual item may differ from photo shown
- Electrical items MAY be 110 volts.
- 7 Day Return Policy
- All products are genuine and original
About Communication Complexity: And Applications
Product Description 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. 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 '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 Book Description 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, streaming algorithms and distributed computing. About the Author 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.
