Knihu momentálně nemáme skladem
Více o knize
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.
Nákup knihy
Communication Complexity (for Algorithm Designers), Tim Roughgarden
- Jazyk
- Rok vydání
- 2016
- product-detail.submit-box.info.binding
- (měkká)
Jakmile ji vyčmucháme, pošleme vám e-mail.
Doručení
Platební metody
Navrhnout úpravu
- Titul
- Communication Complexity (for Algorithm Designers)
- Jazyk
- anglicky
- Autoři
- Tim Roughgarden
- Vydavatel
- Now Publishers Inc
- Rok vydání
- 2016
- Vazba
- měkká
- Počet stran
- 206
- ISBN13
- 9781680831146
- Kategorie
- Počítače, IT, programování
- Anotace
- 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.