Complexity of sequential and parallel numerical algorithms

Name: Complexity of sequential and parallel numerical algorithms
Author: Symposium on Complexity of Sequential and Parallel Numerical Algorithms (1973 Carnegie-Mellon University)

by Symposium on Complexity of Sequential and Parallel Numerical Algorithms (1973 Carnegie-Mellon University)

Subjects Computer algorithms · Computer programming · Data processing · Mathematics · Parallel processing (Electronic computers) · Sequential processing (Computer science)

Language ENG

Free download

Download "Complexity of sequential and parallel numerical algorithms"

PDF·EPUB·MOBI·TXT

No signup. No fees. Yours to keep.

About this book

Complexity of sequential and parallel numerical algorithms, written by Symposium on Complexity of Sequential and Parallel Numerical Algorithms (1973 Carnegie-Mellon University), is now in the public domain and available here for free download. this title joins thousands of works in our science collection.

Click the download button above to receive the complete text in your preferred ebook format—PDF, EPUB, MOBI, or plain text.