Communication Complexity Parallel Computing by Hromkovi Juraj (12 results)
Language: English
Published by Berlin, Springer 1997
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Hardcover
Seller: Antiquariat Bookfarm, Löbnitz, GermanyAntiquariat Bookfarm
Contact seller5-star sellerCondition: Used
£ 17.66
£ 34.46 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
Language: English
Published by Springer 2010
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 70.47
£ 3.03 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 352.
Language: English
Published by Springer Berlin Heidelberg 2010
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 47.46
£ 53.99 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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 th…eory 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.
Language: English
Published by Springer, Springer Vieweg 1997
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 47.46
£ 54.71 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: 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.
More imagesLanguage: English
Published by Springer 2010
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 44.68
£ 60.31 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: 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]har…tmann[at]springer[dot]com | Anbieter: preigu.
Language: English
Published by Springer Berlin Heidelberg Dez 2010 2010
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 47.46
£ 19.82 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: 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 comp…lexity 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.
Language: English
Published by Springer Berlin Heidelberg Feb 1997 1997
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Hardcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 47.46
£ 19.82 shippingShips from Germany to U.S.A.Quantity: 2 available
Buch. Condition: 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.
Language: English
Published by Springer 2010
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 70.79
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand pp. 352 40 Illus.
Language: English
Published by Springer 2010
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 72.20
£ 8.57 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. 352.
Language: English
Published by Springer, Springer Vieweg Dez 2010 2010
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 47.46
£ 51.69 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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.
Language: English
Published by Springer, Springer Vieweg Feb 1997 1997
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Hardcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 47.46
£ 51.69 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: 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 fur…ther research.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 356 pp. Englisch.
More imagesLanguage: English
Published by Springer 1997
Series: Texts in Theoretical Computer Science. An EATCS, Book 36 of 45. Book 36 of 45 - Texts in Theoretical Computer Science. An EATCS
- Hardcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 43.53
£ 60.31 shippingShips from Germany to U.S.A.Quantity: 5 available
Buch. Condition: 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]sprin…ger[dot]com | Anbieter: preigu Print on Demand.
