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.

Product Description:

This book is devoted to the investigation of a special topic in theoretical computer science - communication complexity as an abstract measure of the complexity of computing problems. Its main aim is to show how the theoretical study of communication complexity can be useful in the process of designing effective parallel algorithms. The author shows how to get important information about the parallel complexity (parallel time, the number of processors, the descriptional complexity of the topology of the parallel architecture) of specific computing problems from knowledge of their communication complexity. The book is written as a textbook for undergraduate and graduate students and provides a careful explanation of the subject as well as motivation for further research.

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

Other Popular Editions of the Same Title

9783540574590: Communication Complexity and Parallel Computing: The Application of Communication Complexity in Parallel Computing (Texts in Theoretical Computer Science. An EATCS Series)

Featured Edition

ISBN 10:  354057459X ISBN 13:  9783540574590
Publisher: Springer, 1997
Hardcover

9780387574592: Communication Complexity and Parallel Computing: The Application of Communication Complexity in Parallel Computing (Texts in Theoretical Computer Science - An Eatcs Series)

Spring..., 1997
Hardcover

Top Search Results from the AbeBooks Marketplace

1.

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

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
£ 50.73
Convert currency

Add to Basket

Shipping: £ 3.28
From Germany to U.S.A.
Destination, rates & speeds

2.

HromkoviÄ , Juraj
Published by Springer (2017)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Paperback Quantity Available: 10
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)

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

More information about this seller | Contact this seller

Buy New
£ 52.20
Convert currency

Add to Basket

Shipping: £ 3.87
From United Kingdom to U.S.A.
Destination, rates & speeds

3.

Juraj Hromkovic
Published by Springer (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Quantity Available: > 20
Print on Demand
Seller:
Paperbackshop-US
(Wood Dale, IL, U.S.A.)

Book Description Springer, 2010. PAP. Condition: New. New Book. Shipped from UK within 10 to 14 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
£ 53.26
Convert currency

Add to Basket

Shipping: £ 3.07
Within U.S.A.
Destination, rates & speeds

4.

Juraj Hromkovic
Published by Springer (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)

Book Description Springer, 2010. PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 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
£ 51.28
Convert currency

Add to Basket

Shipping: £ 9
From United Kingdom to U.S.A.
Destination, rates & speeds

5.

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

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
£ 67.80
Convert currency

Add to Basket

Shipping: £ 3.07
Within 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.)

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

More information about this seller | Contact this seller

Buy New
£ 67.80
Convert currency

Add to Basket

Shipping: £ 3.07
Within U.S.A.
Destination, rates & speeds

7.

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

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

More information about this seller | Contact this seller

Buy New
£ 74.73
Convert currency

Add to Basket

Shipping: £ 2.52
Within U.S.A.
Destination, rates & speeds

8.

Juraj Hromkovic
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Germany (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Paperback Quantity Available: 10
Seller:
The Book Depository EURO
(London, United Kingdom)

Book Description Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Germany, 2010. Paperback. Condition: New. Language: English. Brand new Book. 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. Softcover reprint of hardcover 1st ed. 1997. Seller Inventory # AAV9783642081859

More information about this seller | Contact this seller

Buy New
£ 74.52
Convert currency

Add to Basket

Shipping: £ 3
From United Kingdom to U.S.A.
Destination, rates & speeds

9.

Juraj HromkoviÄ
Published by Springer (2010)
ISBN 10: 3642081851 ISBN 13: 9783642081859
New Paperback Quantity Available: 1
Seller:
Books Express
(Portsmouth, NH, U.S.A.)

Book Description Springer, 2010. Paperback. Condition: New. Ships with Tracking Number! INTERNATIONAL WORLDWIDE Shipping available. Buy with confidence, excellent customer service! Softcover reprint of hardcover 1st ed. 1997. Seller Inventory # 3642081851n

More information about this seller | Contact this seller

Buy New
£ 199.49
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds