Communication Complexity

Name: Communication Complexity
Price: 55.15 USD
Availability: InStock
ISBN: 9780521029834

ISBN-10: 052102983X

ISBN-13: 9780521029834

Edition: 2006

Authors: Eyal Kushilevitz, Noam Nisan

List price: $55.99

30 day, 100% satisfaction guarantee!

Marketplace

1 new & used from $55.15

what's this?

Rush Rewards U
Members Receive:

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.

Book details

List price: $55.99
Copyright year: 2006
Publisher: Cambridge University Press
Publication date: 11/2/2006
Binding: Paperback
Pages: 208
Size: 7.01" wide x 10.00" long x 0.51" tall
Weight: 0.814
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