Communication Complexity
Communication Complexity
Noam Nisan, Hebrew University of Jerusalem
$55.99
USDMany 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.
- Only book in this area
- Presents unified approach to many issues in many branches of theoretical computer science
- Shows how communication is a key ingredient in those branches
Reviews & endorsements
"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
Product details
November 2006Paperback
9780521029834
208 pages
254 × 178 × 13 mm
0.366kg
21 b/w illus.
Available
Table of Contents
- Preface
- Part I. Two-Party Communication Complexity:
- 1. Basics
- 2. More on covers
- 3. Randomization
- 4. Advanced topics
- Part II. Other Models of Communication:
- 5. The communication complexity of relations
- 6. Multiparty communication complexity
- 7. Variable partition models
- Part III. Applications:
- 8. Networks, communication, and VLSI
- 9. Decision trees and data structures
- 10. Boolean circuit depth
- 11. More boolean circuit lower bounds
- 12. Time and space
- 13. Randomness
- 14. Further topics
- Index of notation
- Appendix. Mathematical background
- Answers to selected problems
- Bibliography
- Index.
