New fast Euclidean algorithms

DOI10.1016/J.JSC.2012.06.003MaRDI QIDQ1930168zbMATH OpenOpenAlexFDO

Authors Sidi Mohamed Sedjelmaci, Marie-Françoise Roy

Publication date 10 January 2013

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2012.06.003

zbMATH Keywords

complexityfast algorithmsgreatest common divisor (gcd)half-greatest common divisor (half-gcd)quotient boot

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05)

Recommendations

• New binary Euclidean algorithms
• Acceleration of Euclidean algorithm and extensions
• Publication:3987501
• Publication:4288322
• A fast Euclidean algorithm for Gaussian integers
• Acceleration of Euclidean Algorithm and Rational Number Reconstruction
• Generalized Euclidean algorithms
• Publication:4714222
• Analysis of fast versions of the Euclid algorithm
• New fast algorithms for elliptic curve arithmetic in affine coordinates

Cited in

(4)

• Fast rational function reconstruction
• Quasi-gcd computations
• New binary Euclidean algorithms
• Toward the best algorithm for approximate GCD of univariate polynomials

This page was built for publication: New fast Euclidean algorithms

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