Complexity of sequential and parallel numerical algorithms - Info and Reading Options
[proceedings]
By Symposium on Complexity of Sequential and Parallel Numerical Algorithms (1973 Carnegie-Mellon University)
"Complexity of sequential and parallel numerical algorithms" was published by Academic Press in 1973 - New York, it has 300 pages and the language of the book is English.
“Complexity of sequential and parallel numerical algorithms” Metadata:
- Title: ➤ Complexity of sequential and parallel numerical algorithms
- Author: ➤ Symposium on Complexity of Sequential and Parallel Numerical Algorithms (1973 Carnegie-Mellon University)
- Language: English
- Number of Pages: 300
- Publisher: Academic Press
- Publish Date: 1973
- Publish Location: New York
“Complexity of sequential and parallel numerical algorithms” Subjects and Themes:
- Subjects: ➤ Computer algorithms - Computer programming - Data processing - Mathematics - Parallel processing (Electronic computers) - Sequential processing (Computer science) - Electronic digital computers, programming - Mathematics, data processing
Edition Specifications:
- Pagination: ix, 300 p.
Edition Identifiers:
- The Open Library ID: OL5413853M - OL7199601W
- Library of Congress Control Number (LCCN): 73005313
- ISBN-10: 0126975507
- All ISBNs: 0126975507
AI-generated Review of “Complexity of sequential and parallel numerical algorithms”:
Read “Complexity of sequential and parallel numerical algorithms”:
Read “Complexity of sequential and parallel numerical algorithms” by choosing from the options below.
Search for “Complexity of sequential and parallel numerical algorithms” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Complexity of sequential and parallel numerical algorithms" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: borrow
- Check if available: The Open Library & The Internet Archive
Find “Complexity of sequential and parallel numerical algorithms” in Libraries Near You:
Read or borrow “Complexity of sequential and parallel numerical algorithms” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Complexity of sequential and parallel numerical algorithms” at a library near you.
Buy “Complexity of sequential and parallel numerical algorithms” online:
Shop for “Complexity of sequential and parallel numerical algorithms” on popular online marketplaces.
- Ebay: New and used books.