Communication complexity and applications
by Rao, Anup
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 research…
Read More ↓Title Statements
- Full title :Communication complexity and applications / Anup Rao, Amir Yehudayoff.
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 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.
Read More ↓Edition Statements
- Publication Date:2020.
Publication Statements
- Publisher(s):Cambridge University Press
- Place of Publication:Cambridge
- Language:eng
- Publication Date:2020.
The Physical Object
- Description:1 online resource (1 recurso electrónico (xvii, 251 páginas))
Edition Identifiers
- ISBN:9781108671644, 1108671640
- oclc:on1286748134
- Dewey Decimal:511.3/52
Table of Contents
Deterministic protocols -- Rank -- Randomized protocols -- Numbers on foreheads -- Discrepancy -- Information -- Compressing communication -- Lifting -- Circuits and proofs -- Memory size -- Data structures -- Extension complexity of polytopes -- Distributed computing.
Read More ↓Writers
No reviews yet. Be the first to rate this work.
Rate & Review