|
![]() |
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: Juraj HromkovičPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: Softcover reprint of hardcover 1st ed. 1997 Dimensions: Width: 15.50cm , Height: 1.80cm , Length: 23.50cm Weight: 0.539kg ISBN: 9783642081859ISBN 10: 3642081851 Pages: 336 Publication Date: 15 December 2010 Audience: Professional and scholarly , Professional & Vocational , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |