Tipsa dina vänner om produkten:
Communication Complexity (for Algorithm Designers) - Foundations and Trends (R) in Theoretical Computer Science Tim Roughgarden
Har du en profil? Logga in
Få avisering om nya utgåvor med Tim Roughgarden
Lägg till din iMusic-önskelista
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öcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
| Releasedatum | 11 maj 2016 |
| ISBN13 | 9781680831146 |
| Utgivare | now publishers Inc |
| Antal sidor | 206 |
| Mått | 234 × 156 × 15 mm · 294 g |
| Språk | Engelska |
