Cantitate/Preț
Produs

Limits to Parallel Computation: P-Completeness Theory

Autor Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo
en Limba Engleză Hardback – iun 1995
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.
Citește tot Restrânge

Preț: 111251 lei

Preț vechi: 183378 lei
-39% Nou

Puncte Express: 1669

Preț estimativ în valută:
21301 22181$ 17673£

Carte tipărită la comandă

Livrare economică 03-10 februarie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780195085914
ISBN-10: 0195085914
Pagini: 336
Ilustrații: line figures
Dimensiuni: 161 x 241 x 28 mm
Greutate: 0.6 kg
Editura: Oxford University Press
Colecția OUP USA
Locul publicării:New York, United States

Recenzii

an excellent reference manual. ... All the chapters are well written, and the extensive bibliography is useful. The authors have been extremely thorough and careful. ... the theory of P-completeness gives us important insights into the nature of the limits of parallel computation, and Greenlaw, Hoover, and Ruzzo have written an excellent reference work. I recommend it highly.