Pastāsti draugiem par šo preci:
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2016. gada 11. maijs |
| ISBN13 | 9781680831146 |
| Izdevēji | now publishers Inc |
| Lapas | 206 |
| Izmēri | 234 × 156 × 15 mm · 294 g |
| Valoda | Angļu |
Vairāk no Tim Roughgarden
Rādīt visu
Mere med samme udgiver
Skatīt visus Tim Roughgarden ( piem., Paperback Book un Hardcover Book )