scientific article
From MaRDI portal
Publication:3590274
zbMath1205.11133MaRDI QIDQ3590274
Publication date: 17 September 2010
Full work available at URL: http://www.m-hikari.com/ija/ija-2010/ija-1-4-2010/index.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
symbolic computationcomplexity analysislinear algebraic systemsgreatest common divisors of polynomialsparametric euclidean algorithmparametric gaussian elimination
Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08) Linear equations (linear algebraic aspects) (15A06) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Matrices, determinants in number theory (11C20)
Related Items (2)
An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ Algorithms for computing greatest common divisors of parametric multivariate polynomials
This page was built for publication:
