Communication Complexity and Parallel Computing - Texts in Theoretical Computer Science: an Eatcs Series - Juraj Hromkovic - Knihy - Springer-Verlag Berlin and Heidelberg Gm - 9783642081859 - 15. decembra 2010
V prípade, že obal a názov nesedia, platí názov

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

Cena
€ 51,49

Objednané zo vzdialeného skladu

Očakávané doručenie 22. - 30. okt
Dostávajte upozornenia na nové nahrávky interpreta Juraj Hromkovic

Naši zákazníci hovoria:

14-dňová lehota na vrátenie podľa európskej legislatívy o ochrane spotrebiteľa
Najvyššie hodnotenie na Trustpilot
Pridať do vášho zoznamu prianí na iMusic

Not rated yet

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

Médium Knihy     Paperback Book   (Kniha s mäkkou väzbou a lepeným chrbtom)
Vydané 15. decembra 2010
ISBN13 9783642081859
Vydavatelia Springer-Verlag Berlin and Heidelberg Gm
Strany 336
Rozmery 156 × 234 × 18 mm   ·   494 g
Jazyk Angličtina  

Viac od Juraj Hromkovic

Zobraziť všetko

Viac od toho istého vydavateľa

Pozrieť všetko od Juraj Hromkovic