New fast Euclidean algorithms

DOI10.1016/j.jsc.2012.06.003zbMath1303.11130OpenAlexW1983313113MaRDI QIDQ1930168

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)

Related Items (1)

Toward the best algorithm for approximate GCD of univariate polynomials

This page was built for publication: New fast Euclidean algorithms