Articoli correlati a Communication Complexity and Parallel Computing
Sinossi
This book shows how to establish the communication complexity of distinct computing problems and to apply this knowledge in parallel processing of computing problems. It gives also a survey of this special topic and includes motivation for further research.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 47,23
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Communication Complexity and Parallel Computing
Immagini fornite dal venditore
Communication Complexity and Parallel Computing
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 5047232
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Communication Complexity and Parallel Computing
Editore:
Springer Berlin Heidelberg Dez 2010, 2010
ISBN 10: 3642081851
ISBN 13: 9783642081859
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. 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. 352 pp. Englisch. Codice articolo 9783642081859
Quantità: 2 disponibili
Immagini fornite dal venditore
Communication Complexity and Parallel Computing
Editore:
Springer Berlin Heidelberg, 2010
ISBN 10: 3642081851
ISBN 13: 9783642081859
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783642081859
Quantità: 1 disponibili
Immagini fornite dal venditore
Communication Complexity and Parallel Computing
ISBN 10: 3642081851
ISBN 13: 9783642081859
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 352 pp. Englisch. Codice articolo 9783642081859
Quantità: 2 disponibili
Foto dell'editore
Communication Complexity and Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783642081859_new
Quantità: Più di 20 disponibili
Foto dell'editore
Communication Complexity and Parallel Computing
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 352. Codice articolo 263075832
Quantità: 4 disponibili
Foto dell'editore
Communication Complexity and Parallel Computing
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Print on Demand pp. 352 40 Illus. Codice articolo 5853479
Quantità: 4 disponibili
Foto dell'editore
Communication Complexity and Parallel Computing
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 352. Codice articolo 183075826
Quantità: 4 disponibili
Foto dell'editore
Communication Complexity and Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020216877
Quantità: Più di 20 disponibili
Foto dell'editore
Communication Complexity and Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: Like New. Like New. book. Codice articolo ERICA75836420818515
Quantità: 1 disponibili