Communication Complexity (Paperback, New ed)

Many 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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	November 2006
First published:	1997
Authors:	Eyal Kushilevitz • Noam Nisan
Dimensions:	254 x 178 x 13mm (L x W x T)
Format:	Paperback - Trade
Pages:	208
Edition:	New ed
ISBN-13:	978-0-521-02983-4
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Computing & IT > Computer communications & networking > General Promotions
LSN:	0-521-02983-X
Barcode:	9780521029834

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!