Communication Complexity:and Applications

计算机科学技术基础学科

售   价:
448.00
发货周期:预计5-7周发货
作      者
出  版 社
出版时间
2020年02月20日
装      帧
ISBN
9781108497985
复制
页      码
266
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 29 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally appears during computation. This introduction presents the most recent developments in an accessible form, providing the language to unify several disjoint research subareas. Written as a guide for a graduate course on communication complexity, it will interest a broad audience in computer science, from advanced undergraduates to researchers in areas ranging from theory to algorithm design to distributed computing. The first part presents basic theory in a clear and illustrative way, offering beginners an entry into the field. The second part describes applications including circuit complexity, proof complexity, streaming algorithms, extension complexity of polytopes, and distributed computing. Proofs throughout the text use ideas from a wide range of mathematics, including geometry, algebra, and probability. Each chapter contains numerous examples, figures, and exercises to aid understanding.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个