Communication complexity parallel computing par hromkovi juraj (12 résultats)
Langue : anglais
Edité par Berlin, Springer 1997
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture rigide
Vendeur : Antiquariat Bookfarm, Löbnitz, AllemagneAntiquariat Bookfarm
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion
EUR 19,90
EUR 40,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
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.
Langue : anglais
Edité par Springer 2010
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture souple
Vendeur : Books Puddle, New York, NY, Etats-UnisBooks Puddle
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 79,49
EUR 3,44 expéditionExpédition nationale : Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. pp. 352.
Langue : anglais
Edité par Springer Berlin Heidelberg 2010
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture souple
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,49
EUR 62,67 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
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.
Langue : anglais
Edité par Springer, Springer Vieweg 1997
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,49
EUR 63,50 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
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 seq…uential 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.
Autres imagesLangue : anglais
Edité par Springer 2010
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture souple
Vendeur : preigu, Osnabrück, Allemagnepreigu
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 50,35
EUR 70,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponible(s)
Taschenbuch. Etat : Neu. Communication Complexity and Parallel Computing | Juraj Hromkovi¿ | Taschenbuch | Texts in Theoretical Computer Science. An EATCS Series | x | Englisch | 2010 | Springer | EAN 9783642081859 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartman…n[at]springer[dot]com | Anbieter: preigu.
Langue : anglais
Edité par Springer Berlin Heidelberg Feb 1997 1997
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture rigide
- impression à la demande
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , AllemagneBuchWeltWeit Ludwig Meier e.K.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,49
EUR 23,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
Buch. 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 t…he 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.
Langue : anglais
Edité par Springer Berlin Heidelberg Dez 2010 2010
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture souple
- impression à la demande
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , AllemagneBuchWeltWeit Ludwig Meier e.K.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,49
EUR 23,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
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 complexi…ty 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.
Langue : anglais
Edité par Springer 2010
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture souple
- impression à la demande
Vendeur : Majestic Books, Hounslow, , Royaume-UniMajestic Books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 79,07
EUR 7,52 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. Print on Demand pp. 352 40 Illus.
Langue : anglais
Edité par Springer 2010
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture souple
- impression à la demande
Vendeur : Biblios, frankfurt am main, HESSE, AllemagneBiblios
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Neuf
EUR 79,00
EUR 9,95 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 4 disponible(s)
Etat : New. PRINT ON DEMAND pp. 352.
Langue : anglais
Edité par Springer, Springer Vieweg Dez 2010 2010
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture souple
- impression à la demande
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagnebuchversandmimpf2000
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,49
EUR 60,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : 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 352 pp. Englisch.
Langue : anglais
Edité par Springer, Springer Vieweg Feb 1997 1997
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture rigide
- impression à la demande
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagnebuchversandmimpf2000
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,49
EUR 60,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Buch. Etat : 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.
Autres imagesLangue : anglais
Edité par Springer 1997
Série : Texts in Theoretical Computer Science. An EATCS, Livre 36 sur 45. Livre 36 sur 45 - Texts in Theoretical Computer Science. An EATCS
- Couverture rigide
- impression à la demande
Vendeur : preigu, Osnabrück, Allemagnepreigu
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 49,05
EUR 70,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponible(s)
Buch. Etat : 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.
