Communication Complexity and Parallel Computing - Texts in Theoretical Computer Science: an Eatcs Series - Juraj Hromkovic - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783642081859 - 2010. gada 15. decembris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

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

Cena
€ 52,49

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 24. jūl. - . gada 3. aug.
Saņemiet paziņojumus par jauniem Juraj Hromkovic izdevumiem

Mūsu klienti saka:

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu
Top vieta Trustpilot
Pievienot savam iMusic vēlmju sarakstam

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

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2010. gada 15. decembris
ISBN13 9783642081859
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 336
Izmēri 156 × 234 × 18 mm   ·   494 g
Valoda Angļu  

Vairāk no Juraj Hromkovic

Rādīt visu

Vairāk no tā paša izdevēja

Skatīt visus Juraj Hromkovic ( piem., Paperback Book un Hardcover Book )