Limits to Parallel Computation: P-Completeness Theory

Limits to Parallel Computation: P-Completeness Theory

Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo
5.0 / 0
0 comments
Sukakah Anda buku ini?
Bagaimana kualitas file yang diunduh?
Unduh buku untuk menilai kualitasnya
Bagaimana kualitas file yang diunduh?
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.
Tahun:
1995
Penerbit:
Oxford University Press, USA
Bahasa:
english
Halaman:
324
ISBN 10:
0195085914
ISBN 13:
9780195085914
File:
DJVU, 2.25 MB
IPFS:
CID , CID Blake2b
english, 1995
Pengubahan menjadi sedang diproses
Pengubahan menjadi gagal

Istilah kunci