Communication Complexity and Parallel Computing
by Juraj Hromkovič

Persian Title: ارتباطات پیچیدگی و محاسبات موازی

Summary and Info
The communication complexity of twoparty 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 welldefined 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 nontrivial 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.
More About the Author
Juraj Hromkovič (born 1958) is a Slovak Computer Scientist and Professor at ETH Zürich. He is the author of numerous monographs and scientific publications in the field of algorithmics, computational complexity theory, and randomization.
Review and Comments
Rate the Book
Communication Complexity and Parallel Computing 0 out of 5 stars based on 0 ratings.
Your Rating: ☆☆☆☆☆★★★★★
Your Rating: ☆☆☆☆☆★★★★★
دانلود رایگان
EBOOK File
Instant Download
دسترسی به لیب دی ال مخصوص کاربران ایرانی است. لیب دی ال نیاز به تایید هویت شما جهت ارائه لینک دانلود دارد. لطفا
اینجا
را کلیک کنید و با پاسخ به یک سوال، هویت خود را تایید نمایید.