Vertel uw vrienden over dit artikel:
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
| Media | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 11 mei 2016 |
| ISBN13 | 9781680831146 |
| Uitgevers | now publishers Inc |
| Pagina's | 206 |
| Afmetingen | 234 × 156 × 15 mm · 294 g |
| Taal en grammatica | Engels |
Meer door Tim Roughgarden
Alles tonen
Mere med samme udgiver
Bekijk alles van Tim Roughgarden ( bijv. Paperback Book en Hardcover Book )