Limits to Parallel Computation: P-Completeness Theory
Oxford University Press, Apr 6, 1995 - Computers - 336 pages
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 consists of an introduction to many fundamental issues in parallel computing. The second half provides lists of P-complete- and open problems. These lists will have lasting value to researchers in both industry and academia. The lists of problems, with their corresponding remarks, the thorough index, and the hundreds of references add to the exceptional value of this resource. While the exciting field of parallel computation continues to expand rapidly, this book serves as a guide to research done through 1994 and also describes the fundamental concepts that new workers will need to know in coming years. It is intended for anyone interested in parallel computing, including senior level undergraduate students, graduate students, faculty, and people in industry. As an essential reference, the book will be needed in all academic libraries.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
acyclic binary bits Boolean circuit bounded circuit family Circuit Value Problem complexity class Computer Science constructed context-free decision problem defined Definition denote depth-first search designated deterministic edge encoding example fanin fanout feasible highly parallel function gadget Given Goldschlager graph G greedy algorithm Greenlaw Hint induced subgraph inherently sequential input instance integer Journal on Computing Karp labeled language layer Lemma lexicographically first maximal logarithmic space many-one maximal independent set maximum flow Mayr memory cells Monotone Circuit Value NC algorithm number of processors O(logn optimal oracle output gate P-complete P-complete problems parallel algorithm parallel complexity parallel computation pebble planar polylogarithmic polynomial PRAM prob problem is P-complete proof reduction Reference remains P-complete Remarks restricted Ruzzo search problem segment sequential algorithm shared memory simulation solved speedup string Symposium Theorem theory topological order tree Turing machine Turing reducibility unary undirected graph variant vertex vertices
Page ix - Jim Hoover's research was supported by the Natural Sciences and Engineering Research Council of Canada grant OGP 38937.