Conte aos seus amigos sobre este 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)
Preço
R$ 3.126,90
excluindo impostos
Item sob encomenda (no estoque do fornecedor)
Espera-se estar pronto para envio 28 de set - 8 de out
Receba avisos sobre novos lançamentos de Greenlaw, Raymond (Assistant Professor, Department of Computer Science, Assistant Professor, Department of Computer Science, University of New Hampshire)
Adicione à sua lista de desejos do iMusic
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
| Mídia | Livros Hardcover Book (Livro com lombada e capa dura) |
| Lançado | 1 de junho de 1995 |
| ISBN13 | 9780195085914 |
| Editoras | Oxford University Press Inc |
| Páginas | 336 |
| Dimensões | 161 × 241 × 28 mm · 596 g |
| Idioma | Inglês |