Computational complexity of sequential and parallel algorithms
by Lydia I. Kronsjö
Part of Wiley series in computing
Discuss Computational complexity of sequential and parallel algorithms with other readers
Join or start a book club for Computational complexity of sequential and parallel algorithms on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Computational complexity of sequential and parallel algorithms?
Sign up free on Readfeed, then browse public clubs or start your own club with Computational complexity of sequential and parallel algorithms as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Computational complexity of sequential and parallel algorithms with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Computational complexity of sequential and parallel algorithms with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.