𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Limits to Parallel Computation: P-Completeness Theory

✍ Scribed by Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo

Publisher
Oxford University Press
Year
1995
Tongue
English
Leaves
327
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Subjects

algorithms; analysis; algorithm design; algorithm analysis; complexity theory; computability; complexity; theoretical computer science; computer science; maths; math; mathematics

πŸ“œ SIMILAR VOLUMES

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

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

Limits to Parallel Computation: P-Comple
πŸ“ Limits to Parallel Computation: P-Completeness Theory
✍ Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo πŸ“‚ Library πŸ“… 1995 🌐 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

Limits to parallel computation. P-comple
πŸ“ Limits to parallel computation. P-completeness theory
✍ Greenlaw R., Hoover H.J., Ruzzo W. πŸ“‚ Library πŸ“… 1995 πŸ› OUP 🌐 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

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