scientific article; zbMATH DE number 1263314

zbMath0925.13009MaRDI QIDQ4234189

K. Yu. Kvashenko, Sergey A. Abramov

Publication date: 20 July 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fast algorithmgreatest common divisor of polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to single equations (65H05) Polynomials over commutative rings (13B25) Polynomials, factorization in commutative rings (13P05)

Related Items (4)

An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ A direct algorithm to construct the minimal \(Z\)-pairs for rational functions. ⋮ Algorithms for computing greatest common divisors of parametric multivariate polynomials ⋮ Computing the shapes arising in a family of space rational curves depending on one parameter

This page was built for publication: