この商品を友人に教える:
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
| メディア | 書籍 Paperback Book (ソフトカバーで背表紙を接着した本) |
| リリース済み | 2016年5月11日 |
| ISBN13 | 9781680831146 |
| 出版社 | now publishers Inc |
| ページ数 | 206 |
| 寸法 | 234 × 156 × 15 mm · 294 g |
| 言語 | 英語 |
Tim Roughgardenの他の作品を見る
すべて表示
Mere med samme udgiver
Tim Roughgardenのすべてを見る ( 例： Paperback Book および Hardcover Book )