Limits to Parallel Computation: P-Completeness Theory

April 1, 1995|
Limits to Parallel Computation: P-Completeness Theory by Raymond Greenlaw
Earn 1,678 plum® points
Prices and offers may vary in store

Ships within 1-3 weeks

Ships free on orders over $35

Not available in stores


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.
Raymond Greenlaw is at University of New Hampshire. H. James Hoover is at University of Alberta.
Title:Limits to Parallel Computation: P-Completeness TheoryFormat:HardcoverProduct dimensions:336 pages, 9.49 X 6.34 X 1.06 inShipping dimensions:336 pages, 9.49 X 6.34 X 1.06 inPublished:April 1, 1995Publisher:Oxford University PressLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0195085914

ISBN - 13:9780195085914

Appropriate for ages: All ages

Look for similar items by category: