Bookbot
The book is currently out of stock

Communication Complexity (for Algorithm Designers)

Parameters

Pages
206 pages
Reading time
8 hours

More about the book

Focusing on communication complexity, this text presents lecture notes from a Stanford course, emphasizing key problems like Disjointness and Gap-Hamming. It aims to equip readers with the tools to understand and prove lower bounds for algorithms, showcasing the connection between algorithmic challenges and communication complexity. This resource is particularly valuable for algorithm designers seeking to deepen their knowledge in this specialized area.

Book purchase

Communication Complexity (for Algorithm Designers), Tim Roughgarden

Language
Released
2016
product-detail.submit-box.info.binding
(Paperback)
We’ll notify you via email once we track it down.

Payment methods