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) - Libros - Oxford University Press Inc - 9780195085914 - 6 de abril de 1995
En caso de que portada y título no coincidan, el título será el correcto

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

Precio
$ 554,99
sin IVA

Pedido desde almacén remoto

Entrega prevista 19 de jun. - 8 de jul.

Nuestros clientes opinan:

Política de devolución de 14 días conforme a la legislación europea de protección de los consumidores
Mejor valorado en Trustpilot
Añadir a tu lista de deseos de iMusic

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

Medios de comunicación Libros     Hardcover Book   (Libro con lomo y cubierta duros)
Publicado 6 de abril de 1995
ISBN13 9780195085914
Editores Oxford University Press Inc
Páginas 336
Dimensiones 161 × 241 × 28 mm   ·   671 g
Lengua Inglés  

Mere med samme udgiver

Ver todo de Greenlaw, Raymond (Assistant Professor, Department of Computer Science, Assistant Professor, Department of Computer Science, University of New Hampshire) ( Ej. Hardcover Book )