- Hardcover: 205 pages
- Publisher: Cambridge University Press (December 28, 1996)
- Language: English
- ISBN-10: 0521560675
- ISBN-13: 978-0521560672
- Product Dimensions: 7 x 0.7 x 10 inches
- Shipping Weight: 1.5 pounds
- Average Customer Review: 4 customer reviews
- Amazon Best Sellers Rank: #2,163,582 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Use the Amazon App to scan ISBNs and compare prices.
Customers who viewed this item also viewed
"This is a great book! The topics are well-chosen and the presentation is excellent...I spent most of my Thanksgiving and Christmas vacation (and some time in between) reading this book. That I wanted to speaks well of its choice of topics. That I was able to speaks well of its presentation." SIGACT News
"This is an excellent book devoted to communication complexity of two-party protocols introduced by A.C.C. Yao....I believe that it will be very useful in stimulating research in this area." Juraj Hromkovic, Mathematical Reviews
"I strongly recommend this book to everybody interested in this topic, and to researchers...Its readability and good organization also make it a suitable resource for preparing lectures for graduate students in theoretical computer science and mathematics." Computing Reviews
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.
Discover books for all types of engineers, auto enthusiasts, and much more. Learn more
Top customer reviews
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.