Happy Holidays—Our $30 Gift Card just for you, and books ship free! Shop now>>

Texts in Theoretical Computer Science. An EATCS Series

Communication Complexity and Parallel Computing

Authors: Hromkovič, Juraj

Free Preview

Buy this book

eBook 41,64 €
price for Spain (gross)
  • ISBN 978-3-662-03442-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 51,99 €
price for Spain (gross)
  • ISBN 978-3-540-57459-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 51,99 €
price for Spain (gross)
  • ISBN 978-3-642-08185-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this Textbook

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.

Table of contents (5 chapters)

Table of contents (5 chapters)

Buy this book

eBook 41,64 €
price for Spain (gross)
  • ISBN 978-3-662-03442-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 51,99 €
price for Spain (gross)
  • ISBN 978-3-540-57459-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 51,99 €
price for Spain (gross)
  • ISBN 978-3-642-08185-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Communication Complexity and Parallel Computing
Authors
Series Title
Texts in Theoretical Computer Science. An EATCS Series
Copyright
1997
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-662-03442-2
DOI
10.1007/978-3-662-03442-2
Hardcover ISBN
978-3-540-57459-0
Softcover ISBN
978-3-642-08185-9
Series ISSN
1862-4499
Edition Number
1
Number of Pages
X, 336
Topics