Complexity of parallel computations

✍ Scribed by Ian Parberry

Publisher: John Wiley & Sons Inc
Year: 1987
Tongue: English
Leaves: 212
Series: Research Notes in Theoretical Computer Science
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Communication Complexity and Parallel Co

📁 Communication Complexity and Parallel Computing

✍ Juraj Hromkovič 📂 Library 📅 1997 🏛 Springer 🌐 English

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 design

Communication Complexity and Parallel Co

📁 Communication Complexity and Parallel Computing

✍ Juraj Hromkovič 📂 Library 📅 1997 🏛 Springer 🌐 English

<p>The communication complexity of two-party 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 c

Communication Complexity and Parallel Co

📁 Communication Complexity and Parallel Computing

✍ Juraj Hromkovič 📂 Library 📅 1997 🏛 Springer 🌐 English

Computational Complexity of Sequential a

📁 Computational Complexity of Sequential and Parallel Algorithms

✍ Lydia Kronsjo 📂 Library 📅 1986 🏛 John Wiley & Sons 🌐 English

This book gives a compact yet comprehensive survey of major results in the computational complexity of sequential algorithms. This is followed by a highly informative introduction to the development of parallel algorithms, with the emphasis on non-numerical algorithms. The material is so selected th

Computational Complexity of Sequential a

📁 Computational Complexity of Sequential and Parallel Algorithms

✍ Lydia Kronsjö 📂 Library 📅 1985 🏛 Wiley 🌐 English

Limits to Parallel Computation: P-Comple

📁 Limits to Parallel Computation: P-Completeness Theory

✍ Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo 📂 Library 📅 1995 🏛 Oxford University Press, USA 🌐 English

This book provides a comprehensive analysis of the most important topics in parallel computation. It is written so that it may be used as a self-study guide to the field, and researchers in parallel computing will find it a useful reference for many years to come. The first half of the book consist