Mohlo by sa vám tiež páčiť

Viac informácií o knihe Communication Complexity and Parallel Computing

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 175 bodov

Anotácia knihy

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. There are several approaches to attack hard problems. All have their merits, but also their limitations, and need a large body of theory as their basis. A number of books for each one exist: books on complexity theory, others on approximation algorithms, heuristic approaches, parametrized complexity, and yet others on randomized algorithms. This book discusses thoroughly all of the above approaches. And, amazingly, at the same time, does this in a style that makes the book accessible not only to theoreticians, but also to the non-specialist, to the student or teacher, and to the programmer. Do you think that mathematical rigor and accessibility contradict? Look at this book to find out that they do not, due to the admirable talent of the author to present his material in a clear and concise way, with the idea behind the approach spelled out explicitly, often with a revealing example. Reading this book is a beautiful experience and I can highly recommend it to anyone inte rested in learning how to solve hard problems. It is not just a condensed union of material from other books. Because it discusses the different approaches in depth, it has the chance to compare them in detail, and, most importantly, to highlight under what circumstances which appro- ach might be worth exploring. No book on a single type of solution can do that, but this book does it in an absolutely fasci- nating way that can serve as a pattern for theory textbooks with a high level of generality. (Peter Widmayer) The second edition extends the part on the method of relaxation to linear programming with an emphasis on rounding, LP-duality, and primal-dual schema, and provides a self-contained and trans- parent presentation of the design of randomized algorithms for primality testing.

Parametre knihy

• Celý názov: Communication Complexity and Parallel Computing
• Autor: Juraj Hromkovic
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 336
• EAN: 9783540574590
• ISBN: 354057459X
• ID: 01565738
• Nakladateľ: Springer, Berlin
• Hmotnosť: 666 g
• Rozmery: 240 × 160 × 25 mm
• Rok vydania: 1997

Obľúbené z iného súdka

---

---

---