Communication Complexity and Parallel Computing
Juraj Hromkovič · 1997
Where to buy
Check today’s price on Amazon. We do not show prices because they change daily.
View on AmazonAffiliate link. As an Amazon Associate we earn from qualifying purchases.
About the book
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.
Book details
- Year
- 1997
- Language
- English
- Series
- Texts in Theoretical Computer Science An EATCS Series
- Publisher
- Springer Berlin Heidelberg
- Editions
- 1
- Pages
- 338
- ISBN
- 9783642081859
Data source: Wikidata
More by Juraj Hromkovič
