Bookbot
Das Buch ist derzeit nicht auf Lager

Communication Complexity (for Algorithm Designers)

Parameter

Seitenzahl
206 Seiten
Lesezeit
8 Stunden

Mehr zum Buch

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.

Buchkauf

Communication Complexity (for Algorithm Designers), Tim Roughgarden

Sprache
Erscheinungsdatum
2016
product-detail.submit-box.info.binding
(Paperback)
Wir benachrichtigen dich per E-Mail.

Lieferung

  •  

Zahlungsmethoden

Feedback senden