![]() |
CiteULike | ![]() |
masteraka's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Limits to Parallel Computation: P-Completeness Theory |
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThis book provides a comprehensive analysis of the most important topics inparallel computation. It is written so that it may be used as a self-studyguide to the field, and researchers in parallel computing will find it auseful reference for many years to come. The first half of the book consistsof an introduction to many fundamental issues in parallel computing. Thesecond half provides lists of P-complete- and open problems. These lists willhave lasting value to researchers in both industry and academia. The lists ofproblems, with their corresponding remarks, the thorough index, and thehundreds of references add to the exceptional value of this resource. Whilethe exciting field of parallel computation continues to expand rapidly, thisbook serves as a guide to research done through 1994 and also describes thefundamental concepts that new workers will need to know in coming years. It isintended for anyone interested in parallel computing, including senior levelundergraduate students, graduate students, faculty, and people in industry. Asan essential reference, the book will be needed in all academic libraries.
BibTeX record
RIS record