Communication Complexity and Parallel Computing

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.

שנה

1997

שפה

English

סדרה

Texts in Theoretical Computer Science An EATCS Series

הוצאה

Springer Berlin Heidelberg

מהדורות

1

עמודים

338

ISBN

9783642081859

מקור הנתונים: Wikidata