Limits to Parallel Computation P-completeness Theory

Cover of Limits to Parallel Computation P-completeness Theory by Raymond Greenlaw
Year: 1995
Language: en
Edition: 1
Pages: 311
ISBN-13: 9780195085914
Dimensions:
Height: 9.5 Inches
Length: 6.32 Inches
Weight: 1.32497819462 Pounds
Width: 1.082 Inches
Dewey Decimal: 005.2
Editorial overview Touché

Limits to Parallel Computation P-completeness Theory by Raymond Greenlaw, published by Oxford University Press in 1995, offers a thorough examination of key topics in parallel computation. This 311-page book is written in English and serves as both a self-study guide and a reference for researchers in the field. The first half introduces fundamental issues in parallel computing, while the latter half presents lists of P-complete and open problems that are valuable for both industry and academia.

Readers will find a comprehensive analysis that covers essential concepts and challenges in parallel processing, making it suitable for senior undergraduate and graduate students, faculty, and industry professionals. The book includes a detailed index and extensive references, enhancing its utility as a resource for ongoing research. As the field of parallel computation continues to evolve, this edition remains relevant for those seeking foundational knowledge and insights into the discipline.


Official synopsis Publisher

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.

FAQ
What is “Limits to Parallel Computation P-completeness Theory” about?
This page includes the available description and bibliographic details for “Limits to Parallel Computation P-completeness Theory” by Raymond Greenlaw. Synopsis preview: 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 i…
Who is the author of “Limits to Parallel Computation P-completeness Theory”?
“Limits to Parallel Computation P-completeness Theory” is credited to Raymond Greenlaw.
When was “Limits to Parallel Computation P-completeness Theory” published?
Publisher: Oxford University Press. Year: 1995.
What is the ISBN for “Limits to Parallel Computation P-completeness Theory”?
ISBN-13: 9780195085914.
What are the book details (language, pages, edition)?
Language: en. Pages: 311. Edition: 1.

More Books by Raymond Greenlaw

Related Books by Topic