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. 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.-
Information and Randomness
-
Universal Artificial Intelligence
-
Interactive Theorem Proving and Program Development
-
Graphs and Algorithms in Communication Networks
-
Computable Analysis
-
Models of Massive Parallelism
-
Structural Complexity I
-
The Resolution Calculus
-
Models of Computation
-
Dissemination of Information in Optical Networks:
-
A Practical Theory of Reactive Systems
-
Petri Net Synthesis
-
Grammatical Picture Generation
-
Temporal Logic and State Systems
-
Algorithmics for Hard Problems
-
Simulation Algorithms for Computational Systems Biology
-
Public-Key Cryptography
-
Boolean Functions and Computation Models
-
Verification of Reactive Systems
-
Theoretical Computer Science
-
Introduction to Circuit Complexity
-
Elements of Finite Model Theory
-
The Parametric Lambda Calculus
-
The Complexity Theory Companion
-
Introduction to Process Algebra
-
DNA Computing
-
Abstract Computing Machines
-
Design and Analysis of Randomized Algorithms
-
Dissemination of Information in Communication Networks
-
Formal Methods for Software Engineering
-
Complexity Theory and Cryptology
-
Parsing Schemata
Prof. Dr. Juraj Hromkovič lehrt und forscht an der ETH Zürich. Seit 2010 ist er Mitglied der Academia Europaea.
| SKU | Unavailable |
| ISBN 13 | 9783642081859 |
| ISBN 10 | 3642081851 |
| Title | Communication Complexity and Parallel Computing |
| Author | Juraj Hromkovi |
| Series | Texts In Theoretical Computer Science An Eatcs Series |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer |
| Year published | 2010-12-15 |
| Number of pages | 336 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |