Description: Communication Complexity and Parallel Computing by Juraj Hromkovič The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen tal complexity measures of recent complexity theory. FORMAT Hardcover LANGUAGE English CONDITION Brand New Publisher Description This book is devoted to the investigation of a special topic in theoretical computer science - communication complexity as an abstract measure of the complexity of computing problems. Its main aim is to show how the theoretical study of communication complexity can be useful in the process of designing effective parallel algorithms. The author shows how to get important information about the parallel complexity (parallel time, the number of processors, the descriptional complexity of the topology of the parallel architecture) of specific computing problems from knowledge of their communication complexity. The book is written as a textbook for undergraduate and graduate students and provides a careful explanation of the subject as well as motivation for further research. Notes This book shows how to establish the communication complexity of distinct computing problems and to apply this knowledge in parallel processing of computing problems. It gives also a survey of this special topic and includes motivation for further research. Table of Contents 1 Introduction.- 2 Communication Protocol Models.- 3 Boolean Circuits.- 4 VLSI Circuits and Interconnection Networks.- 5 Sequential Computations.- References. Long Description The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen Description for Sales People This book shows how to establish the communication complexity of distinct computing problems and to apply this knowledge in parallel processing of computing problems. It gives also a survey of this special topic and includes motivation for further research. Details ISBN354057459X Short Title COMMUNICATION COMPLEXITY & PAR Language English ISBN-10 354057459X ISBN-13 9783540574590 Media Book Format Hardcover Year 1997 Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Subtitle The Application of Communication Complexity in Parallel Computing Place of Publication Berlin Country of Publication Germany Birth 1958 Pages 336 Illustrations X, 336 p. DOI 10.1007/b47578 Author Juraj Hromkovi Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Edition Description 1997 ed. Series Texts in Theoretical Computer Science. An EATCS Series Edition 1997th Publication Date 1997-02-26 Alternative 9783642081859 DEWEY 004.015118 Audience Undergraduate We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:96272590;
Price: 112.52 AUD
Location: Melbourne
End Time: 2024-12-05T06:18:49.000Z
Shipping Cost: 23.14 AUD
Product Images
Item Specifics
Restocking fee: No
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
ISBN-13: 9783540574590
Book Title: Communication Complexity and Parallel Computing
Number of Pages: 336 Pages
Publication Name: Communication Complexity and Parallel Computing
Language: English
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Item Height: 234 mm
Subject: Engineering & Technology, Computer Science
Publication Year: 1997
Type: Textbook
Item Weight: 1490 g
Author: Juraj Hromkovic
Item Width: 156 mm
Format: Hardcover