Communication Complexity - and Applications (Hardcover)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	February 2020
Authors:	Anup Rao • Amir Yehudayoff
Dimensions:	259 x 181 x 19mm (L x W x T)
Format:	Hardcover
Pages:	266
ISBN-13:	978-1-108-49798-5
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General Books > Reference & Interdisciplinary > Communication studies > Information theory > General
LSN:	1-108-49798-5
Barcode:	9781108497985

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!