Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 49,61
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 49,61
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
EUR 43,25
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
EUR 19,90
Cantidad disponible: 1 disponibles
Añadir al carrito336 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.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 61,93
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 60,65
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 74,18
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 60,63
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: NEPO UG, Rüsselsheim am Main, Alemania
EUR 57,28
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 66,77
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 74,84
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 82,31
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 1997 edition. 336 pages. 9.75x6.50x1.00 inches. In Stock.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 1997
ISBN 10: 354057459X ISBN 13: 9783540574590
Librería: moluna, Greven, Alemania
EUR 47,23
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 92,60
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Springer, Springer Vieweg, 1997
ISBN 10: 354057459X ISBN 13: 9783540574590
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: 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.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg Feb 1997, 1997
ISBN 10: 354057459X ISBN 13: 9783540574590
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: 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.
Idioma: Inglés
Publicado por Springer, Springer Vieweg Feb 1997, 1997
ISBN 10: 354057459X ISBN 13: 9783540574590
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 356 pp. Englisch.
Librería: preigu, Osnabrück, Alemania
EUR 49,05
Cantidad disponible: 5 disponibles
Añadir al carritoBuch. Condición: Neu. Communication Complexity and Parallel Computing | Juraj Hromkovi¿ | Buch | Texts in Theoretical Computer Science. An EATCS Series | x | Englisch | 1997 | Springer | EAN 9783540574590 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.