This book provides a large set of applications that is based on the theory of communication complexity developed by Yao et. al. The material addresses important domains such as covers, randomization and other advanced topics related to two-party communication complexity.

The sections that I found completely interesting are: randomization versus determinism, distributional complexity, protocol rounds and asymmetric communications.

A very enlightening section on communication with partial information is well-presented and explained with examples and exercises. The chapters on "Multiparty Communication Complexity", "Variable Partition Models", and "Networks & VLSI" are exceptionally informative. These chapters provide the mathematical foundation required for the study of several practical systems. For example, the time and area parameters, usually encountered in VLSI design problems, are discussed and a theoretically- efficient chip layout schema is proposed.

The book is radically distinctive and without equal. It provides a large number of applications, examples, and exercises to assist the reader grasp the concepts of the theory of communication complexity.

It is a valuable asset for researchers in computer science, computer engineering and information theory.

Скачать книгу бесплатно (djvu, 1.29 Mb)

---

Читать «Communication Complexity»