Inbunden, Engelska, 1995
Limits to Parallel Computation
P-Completeness Theory
Av Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo
4598 kr
Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.
Beskrivning
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.
Produktinformation
- Utgivningsdatum: 1995-06-01
- Mått: 161 x 241 x 27 mm
- Vikt: 596 g
- Format: Inbunden
- Språk: Engelska
- Antal sidor: 336
- Förlag: OUP USA
- ISBN: 9780195085914
Recensioner i media
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.
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.