Fortæl dine venner om denne vare:
Communication Complexity (for Algorithm Designers) - Foundations and Trends (R) in Theoretical Computer Science
Tim Roughgarden
Pris
DKK 806
Bestilles fra fjernlager
Forventes klar til forsendelse 26. aug. - 2. sep.
Tilføj til din iMusic ønskeseddel
Eller
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
| Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
| Udgivet | 11. maj 2016 |
| ISBN13 | 9781680831146 |
| Forlag | now publishers Inc |
| Antal sider | 206 |
| Mål | 234 × 156 × 15 mm · 294 g |
| Sprog | Engelsk |
Vis alle
Mere med Tim Roughgarden
Se alt med Tim Roughgarden ( f.eks. Paperback Bog og Hardcover bog )