Tim Roughgarden
Communication Complexity (for Algorithm Designers) - Foundations and Trends (R) in Theoretical Computer Science Tim Roughgarden

Do you have a profile? 登录

顾客评价：

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

根据欧洲消费者保护法享受14天退换货政策

Trustpilot平台高分认证

添加至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

介质类型	图书 Paperback Book (平装胶订图书)
已发行	2016年5月11日
ISBN13	9781680831146
出版商	now publishers Inc
页数	206
商品尺寸	234 × 156 × 15 mm · 294 g
语言	英语