Limits to Parallel Computation
P-Completeness Theory
PAYBACK Punkte
213 °P sammeln!
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.
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.
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.
Andere Kunden interessierten sich für
