Blick ins Buch

Communication Complexity and Parallel Computing

Juraj Hromkovič (Autor)

Buch | Hardcover

X, 336 Seiten

1997
Springer Berlin (Verlag)
9783540574590 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

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.

Prof. Dr. Juraj Hromkovic war 1997 - 2003 Professor für Algorithmen und Komplexität an der RWTH Aachen. Seit Januar 2004 ist er Professor für Informatik an der ETH Zürich. Seit 2010 ist er Mitglied der Academia Europaea.

1 Introduction.- 2 Communication Protocol Models.- 3 Boolean Circuits.- 4 VLSI Circuits and Interconnection Networks.- 5 Sequential Computations.- References.

Erscheint lt. Verlag	26.2.1997
Reihe/Serie	Texts in Theoretical Computer Science. An EATCS Series
Zusatzinfo	X, 336 p.
Verlagsort	Berlin
Sprache	englisch
Maße	156 x 234 mm
Gewicht	948 g
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
Schlagworte	algorithms • Boolean circuits • Boolean functions • Boolesche Funktionen • Boolesche Schaltkreise • COMM • Communication • communication complexity • Complexity • formale Sprachen • Formal Languages • Heuristics • Information • Kommunikationskomplexität • parallel computations • Parallele Berechnungen • Parallele Datenverarbeitung • Randomized and Approximation Algorithms • VLSI • VLSI circuits • VLSI-Schaltkreise
ISBN-13	9783540574590 / 9783540574590
Zustand	Neuware