Picture 1 of 1

Stock photo

Communication Complexity by Eyal Kushilevitz: New - Picture 1 of 1

Communication Complexity by Noam Nisan and Eyal Kushilevitz (2006, Trade Paperback)

AlibrisBooks (460395)

98.6% positive Feedback

Price:

US $66.40

Approximately£49.07

+ $15.49 postage

Estimated delivery Mon, 4 Aug - Thu, 14 Aug

Returns:

30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

New

New Trade paperback

About this product

Product Identifiers

PublisherCambridge University Press

ISBN-10052102983X

ISBN-139780521029834

eBay Product ID (ePID)20038311099

Product Key Features

Number of Pages208 Pages

Publication NameCommunication Complexity

LanguageEnglish

SubjectMachine Theory, Electronics / Circuits / Logic, General, Algebra / General

Publication Year2006

TypeTextbook

AuthorNoam Nisan, Eyal Kushilevitz

Subject AreaMathematics, Computers, Technology & Engineering

FormatTrade Paperback

Dimensions

Item Height0.5 in

Item Weight12.9 Oz

Item Length10 in

Item Width7 in

Additional Product Features

Intended AudienceScholarly & Professional

LCCN2007-274686

Reviews"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, "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, "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

Dewey Edition22

IllustratedYes

Dewey Decimal004.6

Table Of ContentPreface; 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.

SynopsisCommunication 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., 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., This book surveys the mathematical theory of communication complexity, concentrating on the question of how much communication is necessary for any particular computing process. Applications of the theory include computer networks, VLSI circuits and data structures.

LC Classification NumberQA267.7 .K87 2006