Limits to parallel computation : P-completeness theory / Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo.
In parallel computation, the complexity of problems that appear can 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 contains many definitions and results...
Full description
Saved in: