AUSTRALIA-WIDE LOW FLAT RATE $9.90

Close Notification

Your cart does not contain any items

Communication Complexity and Parallel Computing

Juraj Hromkovič

$130.95   $105.07

Hardback

Not in-store but you can order this
How long will it take?

QTY:

English
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
26 February 1997
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.
By:  
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Country of Publication:   Germany
Edition:   1997 ed.
Dimensions:   Height: 234mm,  Width: 156mm,  Spine: 20mm
Weight:   1.490kg
ISBN:   9783540574590
ISBN 10:   354057459X
Series:   Texts in Theoretical Computer Science. An EATCS Series
Pages:   336
Publication Date:  
Audience:   College/higher education ,  A / AS level ,  Further / Higher Education
Format:   Hardback
Publisher's Status:   Active
1 Introduction.- 2 Communication Protocol Models.- 3 Boolean Circuits.- 4 VLSI Circuits and Interconnection Networks.- 5 Sequential Computations.- References.

See Also