Communication Complexity and Parallel Computing - Texts in Theoretical Computer Science: an Eatcs Series - Juraj Hromkovic - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783642081859 - December 15, 2010
In case cover and title do not match, the title is correct

Communication Complexity and Parallel Computing - Texts in Theoretical Computer Science: an Eatcs Series 1st Ed. Softcover of Orig. Ed. 1997 edition

Juraj Hromkovic

Price
zł 312.90
excl. VAT

Ordered from remote warehouse

Expected delivery Apr 30 - May 13
Add to your iMusic wish list

Communication Complexity and Parallel Computing - Texts in Theoretical Computer Science: an Eatcs Series 1st Ed. Softcover of Orig. Ed. 1997 edition

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.


336 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released December 15, 2010
ISBN13 9783642081859
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 336
Dimensions 156 × 234 × 18 mm   ·   494 g
Language English  

Show all

More by Juraj Hromkovic