Tell your friends about this item:
Limits to Parallel Computation: P-Completeness Theory Greenlaw, Raymond (Assistant Professor, Department of Computer Science, Assistant Professor, Department of Computer Science, University of New Hampshire)
Limits to Parallel Computation: P-Completeness Theory
Greenlaw, Raymond (Assistant Professor, Department of Computer Science, Assistant Professor, Department of Computer Science, University of New Hampshire)
This monograph focuses on one important topic of parallel computation: the complexity of problems that appear to be difficult to parallelize. The authors present in one reference all of the current definitions and research results in the area.
326 pages, line figures
| Media | Books Hardcover Book (Book with hard spine and cover) |
| Released | April 6, 1995 |
| ISBN13 | 9780195085914 |
| Publishers | Oxford University Press Inc |
| Pages | 336 |
| Dimensions | 161 × 241 × 28 mm · 671 g |
| Language | English |