Communication Complexity : and Applications
Auteur(s) :
Anup Rao (Auteur), Amir Yehudayoff (Auteur)
Editeur(s) :
Cambridge University Press
Rayon(s) :
Informatique
Public(s) :
Public motivé
Ean :
9781108497985
Date de parution :
20/02/2020
Résumé :
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.
Commandable, envoyé en 4 à 6 jours
56,37 €
Notre librairie est en cours de déménagement. Nous ne sommes pas
en mesure des traiter les commandes actuellement. Veuillez nous
excuser pour la gêne occasionnée.
Livraison à partir de 4 € en France métropolitaine