Communication Complexity [Paperback]

Surveys the mathematical theory and applications such as computer networks, VLSI circuits, and data structures.Computers can be described as a series of communication processes on many levels. When more than one computer is involved, even more layers of communication are necessary. 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 begins with simple models of communication and leads up to state-of-the-art theoretical results and applications. It will be an essential resource for graduate students and researchers in theoretical computer science, circuits, networks, VLSI, and information theory.Computers can be described as a series of communication processes on many levels. When more than one computer is involved, even more layers of communication are necessary. 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 begins with simple models of communication and leads up to state-of-the-art theoretical results and applications. It will be an essential resource for graduate students and researchers in theoretical computer science, circuits, networks, VLSI, and information theory.Communication Complexity 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, the authors treat applications of these models, including computer networks, VLSI circuits, and data structures.Preface; Part I. Two-Party Communication Complexity: 1. Basics; 2. More on covers; 3. Randomization; 4. Advanced topics; Part II. Other ModelslÃ;