Communication Complexity and Parallel Computing - Rilegato
Libro 35 di 44: Texts in Theoretical Computer Science. An EATCS
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
1 Introduction.- 2 Communication Protocol Models.- 3 Boolean Circuits.- 4 VLSI Circuits and Interconnection Networks.- 5 Sequential Computations.- References.
Product Description
Book by Hromkovic Juraj
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Communication Complexity and Parallel Computing
Foto dell'editore
Communication Complexity and Parallel Computing
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEOCT25-241510
Compra nuovo
EUR 49,24
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Communication Complexity and Parallel Computing
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Codice articolo ABBB-154339
Compra nuovo
EUR 49,98
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Communication Complexity and Parallel Computing
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Codice articolo Z1-U-017-02113
Compra usato
EUR 43,14
Spedizione EUR 12,30
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Communication complexity and parallel computing.
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
336 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9783540574590 Sprache: Englisch Gewicht in Gramm: 990. Codice articolo 2340148
Compra usato
EUR 19,90
Spedizione EUR 40,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Communication Complexity and Parallel Computing
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 916494
Compra usato
EUR 60,95
Spedizione EUR 2,24
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Communication Complexity and Parallel Computing
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783540574590_new
Compra nuovo
EUR 60,06
Spedizione EUR 13,85
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Communication Complexity and Parallel Computing
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 916494-n
Compra nuovo
EUR 73,39
Spedizione EUR 2,24
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Communication Complexity and Parallel Computing
Editore:
Springer Berlin Heidelberg Feb 1997, 1997
ISBN 10: 354057459X
ISBN 13: 9783540574590
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 356 pp. Englisch. Codice articolo 9783540574590
Compra nuovo
EUR 53,49
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Communication Complexity and Parallel Computing
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 916494-n
Compra nuovo
EUR 60,05
Spedizione EUR 17,34
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Communication Complexity and Parallel Computing: The Application of Communication Complexity in Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)
Editore:
Springer 26.02.1997., 1997
ISBN 10: 354057459X
ISBN 13: 9783540574590
Antico o usato
Rilegato
Da: NEPO UG, Rüsselsheim am Main, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: Sehr gut. Auflage: 1997. 336 Seiten Exemplar aus einer wissenchaftlichen Bibliothek Sprache: Englisch Gewicht in Gramm: 969 24,1 x 16,3 x 2,5 cm, Gebundene Ausgabe. Codice articolo 368171
Compra usato
EUR 57,28
Spedizione EUR 24,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili