Limits to Parallel Computation (inbunden)
Fler böcker inom
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
336
Utgivningsdatum
1995-06-01
Förlag
OUP USA
Medarbetare
Hoover, H. James / Ruzzo, Walter L.
Illustrationer
figs.
Dimensioner
235 x 163 x 31 mm
Vikt
672 g
Antal komponenter
1
Komponenter
xiii, 311 p. ;
ISBN
9780195085914

Limits to Parallel Computation

P-Completeness Theory

av Raymond Greenlaw
Inbunden,  Engelska, 1995-06-01
2670
Köp
Spara som favorit
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 1 format & utgåvor
This book focuses on one important topic of parallel computation: the complexity of problems that appear to be difficult to parallelize. If a computer scientist or researcher has a problem that seems to be difficult to parallelize, the first place to look will be the list of problems in this book. It will contain nearly all the current definitions and results in the area - something that is currently scattered throughout the computer science literature.
Visa hela texten

Passar bra ihop

  1. Limits to Parallel Computation
  2. +
  3. Nexus

De som köpt den här boken har ofta också köpt Nexus av Yuval Noah Harari (häftad).

Köp båda 2 för 2909 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Raymond Greenlaw

Visa alla böcker av Raymond Greenlaw »

Recensioner i media

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

Innehållsförteckning

PART I: Background and Theory 1: Introduction 2: Parallel Models and Complexity Classes 3: Two Basic P-Complete Problems 4: Evidence that NC Does Not Equal P 5: The Circuit Value Problem 6: Parallel Versions of Sequential Paradigms 7: Boolean Circuits PART II: P-Complete and Open Problems 8: List of P-Complete Problems 9: Open Problems

Du kanske gillar