Skip to content

Opening book details…

Can I read Computational Complexity of Sequential and Parallel Algorithms (Wiley Series in Computing) on EtoBox?

Computational Complexity of Sequential and Parallel Algorithms (Wiley Series in Computing) by Lydia I. Kronsjö is a nonfiction available to read on EtoBox.

What is Computational Complexity of Sequential and Parallel Algorithms (Wiley Series in Computing) about?

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.

Who reads Computational Complexity of Sequential and Parallel Algorithms (Wiley Series in Computing)?

It is typically read by self-directed learners exploring a subject in depth.

Common subject areas: history, science, philosophy, social sciences.

Author
Lydia I. Kronsjö
Publisher
John Wiley & Sons, Incorporated
Published
1986
Language
EN
ISBN
9780471908142
Category
nonfiction
Subjects
Computer Science, Mathematics, Science

Other editions & translations

More by Lydia I. Kronsjö

Browse all works by Lydia I. Kronsjö

Similar books