Communication Complexity (for Algorithm Designers)
Download or Read eBook Communication Complexity (for Algorithm Designers) PDF written by Tim Roughgarden and published by Foundations and Trends (R) in Theoretical Computer Science. This book was released on 2016-05-11 with total page 206 pages. Available in PDF, EPUB and Kindle.
Author | : Tim Roughgarden |
Publisher | : Foundations and Trends (R) in Theoretical Computer Science |
Total Pages | : 206 |
Release | : 2016-05-11 |
ISBN-10 | : 1680831143 |
ISBN-13 | : 9781680831146 |
Rating | : 4/5 (43 Downloads) |
Book Synopsis Communication Complexity (for Algorithm Designers) by : Tim Roughgarden
Book excerpt: This book deals mostly with impossibility results - lower bounds on what can be accomplished by algorithms. However, the perspective is unapologetically that of an algorithm designer. The reader will learn lower bound technology on a "need-to-know" basis, guided by fundamental algorithmic problems that we care about.