Variation on Euclid's algorithm for polynomials

DOI10.1049/EL:19970658MaRDI QIDQ5439387zbMATH OpenOpenAlexFDO

Authors L. C. Calvez, P. Vilbe, Stephane Azou

Publication date 11 February 2008

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19970658

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Polynomials: an algorithmic approach
• A polynomial variant of a problem of Diophantus and Euler
• Algorithms for polynomials in two variables
• Algorithmic polynomials
• Algorithmic Polynomials
• Euclidean algorithm and polynomial equations after Labatie
• The Euclidean algorithm and primitive polynomials over finite fields
• POLYNOMIAL VARIATIONS ON A THEME OF SIERPIŃSKI
• An algorithm for sums of squares of real polynomials
• Euclid algorithm, orthogonal polynomials, and generalized Routh-Hurwitz algorithm

Cited in

(1)

• Computing the modular inverses is as simple as computing the GCDs

This page was built for publication: Variation on Euclid's algorithm for polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5439387)