Share
Communication Complexity: And Applications
Anup Rao
(Author)
·
Amir Yehudayoff
(Author)
·
Cambridge University Press
· Hardcover
Communication Complexity: And Applications - Rao, Anup ; Yehudayoff, Amir
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My Wishlists
Origin: U.S.A.
(Import costs included in the price)
It will be shipped from our warehouse between
Wednesday, June 12 and
Tuesday, June 25.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.
Synopsis "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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Hardcover.
✓ Producto agregado correctamente al carro, Ir a Pagar.