The computational complexity of algebraic and numeric problems
by Allan Borodin
Book 1 of Elsevier computer science library : Theory of computation series
No club is reading this yet — be the first to start one
Discuss The computational complexity of algebraic and numeric problems with other readers
Join or start a book club for The computational complexity of algebraic and numeric problems 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 The computational complexity of algebraic and numeric problems?
Sign up free on Readfeed, then browse public clubs or start your own club with The computational complexity of algebraic and numeric problems as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss The computational complexity of algebraic and numeric problems with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about The computational complexity of algebraic and numeric problems 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.