Fortell venner om denne varen:
Communication Complexity (for Algorithm Designers) - Foundations and Trends (R) in Theoretical Computer Science Tim Roughgarden
Har du en profil? Logg inn
Legg til iMusic ønskeliste
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
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 11. mai 2016 |
| ISBN13 | 9781680831146 |
| Utgivere | now publishers Inc |
| Antall sider | 206 |
| Mål | 234 × 156 × 15 mm · 294 g |
| Språk | Engelsk |
Mer med Tim Roughgarden
Vis alle
Mere med samme udgiver
Se alt med Tim Roughgarden ( f.eks. Pocketbok og Innbunden bok )