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

0 avg rating
( 0 ratings by Goodreads )
 
9783642081859: Communication Complexity and Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)
View all copies of this ISBN edition:
 
 

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.

"synopsis" may belong to another edition of this title.

Review:

Altogether, students and researchers interested in the field of complexity theory get an informative compendium at their disposal. Formulations are precise, and the proofs are exact and complete...the book should be contained in the library of every complexity theorist. -- Christoph Meinel, Mathematical Reviews, Issue 98f

"About this title" may belong to another edition of this title.

Top Search Results from the AbeBooks Marketplace

1.

Juraj Hromkovic
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 2010. PAP. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9783642081859

More Information About This Seller | Contact this Seller

Buy New
US$ 67.18
Convert Currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, Rates & Speeds

2.

HromkoviĨ, Juraj
Published by Springer (2016)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Paperback Quantity Available: 1
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)
Rating
[?]

Book Description Springer, 2016. Paperback. Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Seller Inventory # ria9783642081859_lsuk

More Information About This Seller | Contact this Seller

Buy New
US$ 67.84
Convert Currency

Add to Basket

Shipping: US$ 5.38
From United Kingdom to U.S.A.
Destination, Rates & Speeds

3.

Juraj Hromkovic
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, 2010. PAP. Condition: New. New Book. Delivered from our UK warehouse in 3 to 5 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # LQ-9783642081859

More Information About This Seller | Contact this Seller

Buy New
US$ 61.68
Convert Currency

Add to Basket

Shipping: US$ 12.47
From United Kingdom to U.S.A.
Destination, Rates & Speeds

4.

Juraj Hromkovi?
Published by Springer (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Softcover Quantity Available: 15
Print on Demand
Seller:
Rating
[?]

Book Description Springer, 2010. Condition: New. This item is printed on demand for shipment within 3 working days. Seller Inventory # LP9783642081859

More Information About This Seller | Contact this Seller

Buy New
US$ 71.62
Convert Currency

Add to Basket

Shipping: US$ 3.65
From Germany to U.S.A.
Destination, Rates & Speeds

5.

JURAJ HROMKOVIˇ¨
Published by Springer (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Paperback Quantity Available: 1
Seller:
Herb Tandree Philosophy Books
(Stroud, GLOS, United Kingdom)
Rating
[?]

Book Description Springer, 2010. Paperback. Condition: NEW. 9783642081859 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal. Seller Inventory # HTANDREE0350577

More Information About This Seller | Contact this Seller

Buy New
US$ 64.22
Convert Currency

Add to Basket

Shipping: US$ 11.09
From United Kingdom to U.S.A.
Destination, Rates & Speeds

6.

Juraj Hromkovic
Published by Springer (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Paperback Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Springer, 2010. Paperback. Condition: New. Softcover reprint of hardcover 1. Seller Inventory # DADAX3642081851

More Information About This Seller | Contact this Seller

Buy New
US$ 79.20
Convert Currency

Add to Basket

Shipping: US$ 4.99
Within U.S.A.
Destination, Rates & Speeds

7.

Juraj Hromkovic
Published by Springer (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Paperback Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Springer, 2010. Paperback. Condition: New. Seller Inventory # SONG3642081851

More Information About This Seller | Contact this Seller

Buy New
US$ 81.33
Convert Currency

Add to Basket

Shipping: US$ 4.99
Within U.S.A.
Destination, Rates & Speeds

8.

Hromkovic, Juraj
Published by Springer (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Paperback Quantity Available: 10
Print on Demand
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Springer, 2010. Paperback. Condition: New. This item is printed on demand. Seller Inventory # INGM9783642081859

More Information About This Seller | Contact this Seller

Buy New
US$ 88.01
Convert Currency

Add to Basket

Shipping: US$ 4.99
Within U.S.A.
Destination, Rates & Speeds

9.

Juraj Hromkovic
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. K
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Paperback Quantity Available: > 20
Seller:
BuySomeBooks
(Las Vegas, NV, U.S.A.)
Rating
[?]

Book Description Springer-Verlag Berlin and Heidelberg GmbH & Co. K. Paperback. Condition: New. 336 pages. Dimensions: 9.0in. x 6.0in. x 0.8in.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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Seller Inventory # 9783642081859

More Information About This Seller | Contact this Seller

Buy New
US$ 94.67
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

10.

Juraj Hromkovi?
Published by Springer (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Paperback Quantity Available: 1
Seller:
Irish Booksellers
(Portland, ME, U.S.A.)
Rating
[?]

Book Description Springer, 2010. Paperback. Condition: New. book. Seller Inventory # M3642081851

More Information About This Seller | Contact this Seller

Buy New
US$ 100.25
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

There are more copies of this book

View all search results for this book