Computational complexity of sequential and parallel algorithms
Author(s)
Bibliographic Information
Computational complexity of sequential and parallel algorithms
（Wiley series in computing）
Wiley, 1986, c1985
Available at / 39 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes index
Bibliography: p. 212-219
Description and Table of Contents
Description
This book gives a compact yet comprehensive survey of major results in the computational complexity of sequential algorithms. This is followed by a highly informative introduction to the development of parallel algorithms, with the emphasis on non-numerical algorithms. The material is so selected that the reader in many cases is able to follow the same problem for which both sequential and parallel algorithms are discussed - the simultaneous presentation of sequential and parallel algorithms for solving enabling the reader to apprehend their common and unique features.
by "Nielsen BookData"