
Communication Complexity and Parallel Computing
Juraj Hromkovic(Author)
Springer (Publisher)
Published on 15. December 2010
Book
Paperback/Softback
X, 336 pages
978-3-642-08185-9 (ISBN)
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 tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication complex ity is used as a method for the study of the complexity of concrete computing problems in parallel information processing. Especially, it is applied to prove lower bounds that say what computer resources (time, hardware, memory size) are necessary to compute the given task. Besides the estimation of the compu tational difficulty of computing problems the proved lower bounds are useful for proving the optimality of algorithms that are already designed. In some cases the knowledge about the communication complexity of a given problem may be even helpful in searching for efficient algorithms to this problem. The study of communication complexity becomes a well-defined indepen dent area of complexity theory. In addition to a strong relation to several funda mental complexity measures (and so to several fundamental problems of com plexity theory) communication complexity has contributed to the study and to the understanding of the nature of determinism, nondeterminism, and random ness in algorithmics. There already exists a non-trivial mathematical machinery to handle the communication complexity of concrete computing problems, which gives a hope that the approach based on communication complexity will be in strumental in the study of several central open problems of recent complexity theory.
More details
Series
Edition
Softcover reprint of hardcover 1st ed. 1997
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Primary & secondary/elementary & high school
Graduate
Illustrations
X, 336 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 20 mm
Weight
534 gr
ISBN-13
978-3-642-08185-9 (9783642081859)
DOI
10.1007/978-3-662-03442-2
Schweitzer Classification
Other editions
Additional editions

Juraj Hromkovic
Communication Complexity and Parallel Computing
Book
02/1997
Springer
€53.49
Shipment within 10-15 days
Person
Also Author of our books "Communication Complexity and Parallel Computing", 57459-X and "Algorithmics for Hard Problems" 2nd ed., 44134-4; Advisory Board member of the EATCS series.
Content
1 Introduction.- 2 Communication Protocol Models.- 3 Boolean Circuits.- 4 VLSI Circuits and Interconnection Networks.- 5 Sequential Computations.- References.