On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342)

From MaRDI portal
Revision as of 13:40, 16 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7572153
Language Label Description Also known as
English
On the complexity of computing the greatest common divisor of several univariate polynomials
scientific article; zbMATH DE number 7572153

    Statements

    On the complexity of computing the greatest common divisor of several univariate polynomials (English)
    0 references
    16 August 2022
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references