Povej prijatelju o tem izdelku:
Communication Complexity (for Algorithm Designers) - Foundations and Trends (R) in Theoretical Computer Science Tim Roughgarden
Do you have a profile? Prijava
Prejemajte obvestila o novih izdajah izvajalca Tim Roughgarden
Kaj pravijo naše stranke:
Dodaj na svoj seznam želja iMusic
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
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 11. maja 2016 |
| ISBN13 | 9781680831146 |
| Založniki | now publishers Inc |
| Strani | 206 |
| Dimenzije | 234 × 156 × 15 mm · 294 g |
| Jezik | Angleščina |
Več od Tim Roughgarden
Prikaži vse
Več od istega **izdajatelja**
Ogled vseh Tim Roughgarden ( Na primer Paperback Book in Hardcover Book )