Sebastiaan J. C. Joosten 📧, René Thiemann 🌐 and Akihisa Yamada 📧

April 6, 2017

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


We formalize the theory of subresultants and the subresultant polynomial remainder sequence as described by Brown and Traub. As a result, we obtain efficient certified algorithms for computing the resultant and the greatest common divisor of polynomials.


BSD License


Session Subresultants