Le livre est actuellement en rupture de stock
En savoir plus sur le livre
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.
Achat du livre
Communication Complexity (for Algorithm Designers), Tim Roughgarden
- Langue
- Année de publication
- 2016
- product-detail.submit-box.info.binding
- (souple)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.
Modes de paiement
Personne n'a encore évalué .