Polynomial Algorithms in Computer Algebra

Polynomial Algorithms in Computer Algebra

by Franz Winkler

Part of Texts and Monographs in Symbolic Computation, A Series of the Research Institute for Symbolic Computation, Johannes-Kepler-University, Linz, Austria, 0943-853X

Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
The book gives a thorough introduction to the mathematical underpinnings of computer algebra. The subjects treated range from arithmetic of integers and polynomials to fast factorization methods, Gröbner bases, and algorithms in algebraic geometry. The algebraic background for all the algorithms presented in the book is fully described, and most of the algorithms are investigated with respect to their computational complexity. Each chapter closes with a brief survey of the related literature.

Discuss Polynomial Algorithms in Computer Algebra with other readers

Join or start a book club for Polynomial Algorithms in Computer Algebra on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Polynomial Algorithms in Computer Algebra?

Sign up free on Readfeed, then browse public clubs or start your own club with Polynomial Algorithms in Computer Algebra as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Polynomial Algorithms in Computer Algebra with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Polynomial Algorithms in Computer Algebra 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.