Limits to Parallel Computation: P-Completeness Theory New Edition

Limits to Parallel Computation: P-Completeness Theory New Edition book cover

Limits to Parallel Computation: P-Completeness Theory New Edition

Author(s): Raymond Greenlaw (Author), Walter L. Ruzzo (Author), H. James Hoover (Author)

  • Publisher: Oxford University Press
  • Publication Date: 6 April 1995
  • Edition: New
  • Language: English
  • Print length: 336 pages
  • ISBN-10: 0195085914
  • ISBN-13: 9780195085914

Book Description

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 an interest in the super computers of the future.

Editorial Reviews

Review

"This is an excellent book about the classification of computing problems....I am sure that it can be useful as a textbook for students or as basic material for researchers wanting to start some research in this area." --Mathematical Reviews

Review

"This is an excellent book about the classification of computing problems....I am sure that it can be useful as a textbook for students or as basic material for researchers wanting to start some research in this area." --Mathematical Reviews

View on Amazon

未经允许不得转载:Wow! eBook » Limits to Parallel Computation: P-Completeness Theory New Edition