Title: Subresultants
Authors: Sebastiaan Joosten, René Thiemann and Akihisa Yamada (akihisa /dot/ yamada /at/ aist /dot/ go /dot/ jp)
Submission date: 2017-04-06
Abstract: 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.
  author  = {Sebastiaan Joosten and René Thiemann and Akihisa Yamada},
  title   = {Subresultants},
  journal = {Archive of Formal Proofs},
  month   = apr,
  year    = 2017,
  note    = {\url{},
            Formal proof development},
  ISSN    = {2150-914x},
License: BSD License
Depends on: Jordan_Normal_Form, Polynomial_Factorization
Used by: Berlekamp_Zassenhaus
Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.