Spend $50 to get a
This item qualifies for FREE shipping.
30 day, 100% satisfaction guarantee!
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
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.
Copyright year: 2006
Publisher: Cambridge University Press
Publication date: 11/2/2006
Size: 6.75" wide x 9.75" long x 0.50" tall
|Two-Party Communication Complexity|
|More on covers|
|Other Models of Communication|
|The communication complexity of relations|
|Multiparty communication complexity|
|Variable partition models|
|Networks, communication, and VLSI|
|Decision trees and data structures|
|Boolean circuit depth|
|More boolean circuit lower bounds|
|Time and space|
|Index of notation|
|Answers to selected problems|