
Conte aos seus amigos sobre este item:
Communication Complexity (for Algorithm Designers) - Foundations and Trends (R) in Theoretical Computer Science
Tim Roughgarden
Communication Complexity (for Algorithm Designers) - Foundations and Trends (R) in Theoretical Computer Science
Tim Roughgarden
The two primary goals of the text are to learn several canonical problems in communication complexity that are useful for proving lower bounds for algorithms (Disjointness, Index, Gap-Hamming, and so on); and to learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds.
206 pages
Mídia | Livros Paperback Book (Livro de capa flexível e brochura) |
Lançado | 11 de maio de 2016 |
ISBN13 | 9781680831146 |
Editoras | now publishers Inc |
Páginas | 206 |
Dimensões | 234 × 156 × 15 mm · 294 g |
Idioma | English |
Mostrar tudo
Mais por Tim Roughgarden
Ver tudo de Tim Roughgarden ( por exemplo Paperback Book e Hardcover Book )