Communication Complexity and Parallel Computing - Couverture souple

Hromkovič, Juraj

9783642081859: Communication Complexity and Parallel Computing

Couverture souple

ISBN 10 : 3642081851 ISBN 13 : 9783642081859

Editeur : Springer, 2010

Afficher les exemplaires de cette �dition comportant l?ISBN

1 D'occasion

De EUR 108,45

9 Neuf

De EUR 47,23

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.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: Springer
Date d'�dition: 2010
Langue: anglais
ISBN 10: 3642081851
ISBN 13: 9783642081859
Reliure: Broch�
Nombre de pages: 352
Coordonn�es du fabricant: non disponible
Personne responsable: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Allemagne

Acheter D'occasion

�tat : Comme neuf

Like New

Afficher cet article

EUR 108,45

Autre devise

EUR 28,61 exp�dition depuis Royaume-Uni vers France

Destinations, frais et d�lais

Ajouter au panier

Acheter neuf

Afficher cet article

EUR 47,23

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783540574590: Communication Complexity and Parallel Computing

Edition pr�sent�e

ISBN 10 : 354057459X ISBN 13 : 9783540574590
Editeur : Springer-Verlag Berlin and Heide..., 1997
Couverture rigide

(Couverture rigide)

R�sultats de recherche pour Communication Complexity and Parallel Computing

Image fournie par le vendeur

Communication Complexity and Parallel Computing

Juraj Hromkovic

Edit� par Springer Berlin Heidelberg, 2010

ISBN 10 : 3642081851 ISBN 13 : 9783642081859

Neuf Couverture souple

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : New. N� de r�f. du vendeur 5047232

Contacter le vendeur

Acheter neuf

EUR 47,23

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Communication Complexity and Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)

Hromkovi?, Juraj

Edit� par Springer, 2010

ISBN 10 : 3642081851 ISBN 13 : 9783642081859

Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Etat : New. In. N� de r�f. du vendeur ria9783642081859_new

Contacter le vendeur

Acheter neuf

EUR 59,90

Autre devise

Frais de port : EUR 4,57

De Royaume-Uni vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Communication Complexity and Parallel Computing

Juraj Hromkovi�

Edit� par Springer Berlin Heidelberg, 2010

ISBN 10 : 3642081851 ISBN 13 : 9783642081859

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783642081859

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Communication Complexity and Parallel Computing

Juraj Hromkovi�

Edit� par Springer Berlin Heidelberg Dez 2010, 2010

ISBN 10 : 3642081851 ISBN 13 : 9783642081859

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783642081859

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 11

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Communication Complexity and Parallel Computing

Juraj Hromkovi�

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2010, 2010

ISBN 10 : 3642081851 ISBN 13 : 9783642081859

Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783642081859

Contacter le vendeur