Communication Complexity and Parallel Computing
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 4,51 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisEUR 7,95 expédition depuis Allemagne vers France
Destinations, frais et délaisVendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Etat : 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. N° de réf. du vendeur Z1-U-017-02113
Quantité disponible : 1 disponible(s)
Vendeur : Ammareal, Morangis, France
Hardcover. Etat : Très bon. Ancien livre de bibliothèque. Edition 1997. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1997. Ammareal gives back up to 15% of this item's net price to charity organizations. N° de réf. du vendeur E-595-493
Quantité disponible : 1 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. pp. 356. N° de réf. du vendeur 182170282
Quantité disponible : 1 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 356. N° de réf. du vendeur 262170272
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. 356 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. N° de réf. du vendeur 5677695
Quantité disponible : 1 disponible(s)
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
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. N° de réf. du vendeur 2340148
Quantité disponible : 1 disponible(s)
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Etat : 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. N° de réf. du vendeur ABNR-83880
Quantité disponible : 1 disponible(s)
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEJUNE24-267911
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. N° de réf. du vendeur 4894327
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. 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 9783540574590
Quantité disponible : 1 disponible(s)