Computational complexity of sequential and parallel algorithms /
Presents a concise treatment of important results from the theory and application of sequential algorithms and introduces parallel algorithms. Allows the reader to compare, contrast, and appreciate unique features of the computing environment. Presents important achievements in design methodology of...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Chichester ; New York :
Wiley,
[1985]
|
| Series: | Wiley series in computing.
|
| Subjects: | |
| Summary: | Presents a concise treatment of important results from the theory and application of sequential algorithms and introduces parallel algorithms. Allows the reader to compare, contrast, and appreciate unique features of the computing environment. Presents important achievements in design methodology of sequential algorithms. Introduces new solutions in the field of parallel algorithms. |
Annex
| Call Number: |
QA 76.6 .K763 1985
|
|---|---|
| Available Request Request a scan of an article or book chapter |