Skip to content

Communication Complexity

Spend $50 to get a free DVD!

ISBN-10: 052102983X

ISBN-13: 9780521029834

Edition: 2006

Authors: Eyal Kushilevitz, Noam Nisan

List price: $52.99
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

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.
Customers also bought

Book details

List price: $52.99
Copyright year: 2006
Publisher: Cambridge University Press
Publication date: 11/2/2006
Binding: Paperback
Pages: 208
Size: 6.75" wide x 9.75" long x 0.50" tall
Weight: 0.836
Language: English

Preface
Two-Party Communication Complexity
Basics
More on covers
Randomization
Advanced topics
Other Models of Communication
The communication complexity of relations
Multiparty communication complexity
Variable partition models
Applications
Networks, communication, and VLSI
Decision trees and data structures
Boolean circuit depth
More boolean circuit lower bounds
Time and space
Randomness
Further topics
Index of notation
Appendix
Mathematical background
Answers to selected problems
Bibliography
Index