株式会社極東書店トップ ＞ 商品一覧 ＞ Limits to Parallel Computation: P-Completeness Theory.
商品詳細
Limits to Parallel Computation: P-Completeness Theory.
・ISBN 978-0-19-508591-4 hard US$ 500.00
￥117,150.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Greenlaw, Raymond / Hoover, H. James / Ruzzo, Walter L., |
|---|---|
| 出版社 | (Oxford University Press Inc, US) |
| 出版年月 | 1995 |
| ページ数 | 336 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A00-21024＞ |
解説
This volume provides an ideal introduction to key topics in parallel computing. With its cogent overview of the essentials of the subject as well as lists of P -complete- and open problems, extensive remarks corresponding to each problem, a thorough index, and extensive references, the book will prove invaluable to programmers stuck on problems that are particularly difficult to parallelize. In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an interest in the super computers of the future.