Share
Limits to Parallel Computation: P-Completeness Theory
Raymond Greenlaw; H. James Hoover; Walter L. Ruzzo (Author)
·
Oxford University Press
· Hardcover
Limits to Parallel Computation: P-Completeness Theory - Raymond Greenlaw; H. James Hoover; Walter L. Ruzzo
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My Wishlists
Origin: U.S.A.
(Import costs included in the price)
It will be shipped from our warehouse between
Tuesday, May 28 and
Thursday, June 13.
You will receive it anywhere in United Kingdom between 1 and 3 business days after shipment.
Synopsis "Limits to Parallel Computation: P-Completeness Theory"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Hardcover.
✓ Producto agregado correctamente al carro, Ir a Pagar.
