Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory.
具体描述
读后感
评分
评分
评分
评分
用户评价
去年读过一段内容，看见今年BASICS summer school要讲这本书
评分去年读过一段内容，看见今年BASICS summer school要讲这本书
评分去年读过一段内容，看见今年BASICS summer school要讲这本书
评分去年读过一段内容，看见今年BASICS summer school要讲这本书
评分去年读过一段内容，看见今年BASICS summer school要讲这本书
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.quotespace.org All Rights Reserved. 小美书屋 版权所有