Sebastiaan Joosten, René Thiemann, Akihisa Yamada

    Research output: Contribution to journalArticleAcademic

    66 Downloads (Pure)


    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.
    Original languageEnglish
    Number of pages28
    JournalArchive of Formal Proofs
    Publication statusPublished - 6 Apr 2017


    Dive into the research topics of 'Subresultants'. Together they form a unique fingerprint.

    Cite this