Limits to Parallel Computation: P-Completeness Theory - Rilegato

Greenlaw, Raymond; Hoover, H. James; Ruzzo, Walter L.

Rilegato

ISBN 10: 0195085914 ISBN 13: 9780195085914

Casa editrice: OUP USA, 1995

Riassunto

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.

Su questo libro

Recensione

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. (Eric Allender, Computing Reviews, July 1996.)

Dettagli dell'edizione

• Editore: OUP USA
• Data di pubblicazione: 1995
• Lingua: Inglese
• ISBN 10: 0195085914
• ISBN 13: 9780195085914
• Rilegatura: Copertina rigida
• Numero di pagine: 336
• Contatto del produttore: Messaggerie Libri; ufficio.anagrafiche@meli.it; ; Via Verdi, 8.; Assago Milano; 20090; Italia