Limits to Parallel Computation P-Completeness Theory

Name: Limits to Parallel Computation P-Completeness Theory
Price: 8.37 USD
Availability: InStock
ISBN: 9780195085914

ISBN-10: 0195085914

ISBN-13: 9780195085914

Edition: 1995

Authors: Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo

List price: $290.00

30 day, 100% satisfaction guarantee!

Marketplace

3 new & used from $8.37

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

This volume provides an ideal introduction to key topics in parallel computing.With its cogent overview of the essentials of the subject as well as lists of P -complete- and open problems, extensive remarks corresponding to each problem, a thorough index, and extensive references, the book will prove invaluable to programmers stuck on problems that are particularly difficult to parallelize. In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with aninterest in the super computers of the future.

Book details

List price: $290.00
Copyright year: 1995
Publisher: Oxford University Press, Incorporated
Publication date: 4/6/1995
Binding: Hardcover
Pages: 336
Size: 6.50" wide x 9.75" long x 1.00" tall
Weight: 1.342
Language: English




Background and Theory



Introduction



Parallel Models and Complexity Classes



Two Basic P-Complete Problems



Evidence that NC Does Not Equal P



The Circuit Value Problem



Parallel Versions of Sequential Paradigms



Boolean Circuits



P-Complete and Open Problems



List of P-Complete Problems



Open Problems