New fast Euclidean algorithms

DOI10.1016/J.JSC.2012.06.003zbMATH Open1303.11130OpenAlexW1983313113MaRDI QIDQ1930168FDOQ1930168

Marie-Françoise Roy, Sidi Mohamed Sedjelmaci

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)

Cited In (2)

• Toward the best algorithm for approximate GCD of univariate polynomials
• New binary Euclidean algorithms

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Acceleration of Euclidean Algorithm and Rational Number Reconstruction 👍 👎
• A fast Euclidean algorithm for Gaussian integers 👍 👎
• New fast algorithms for elliptic curve arithmetic in affine coordinates 👍 👎
• Acceleration of Euclidean algorithm and extensions 👍 👎
• Generalized Euclidean algorithms 👍 👎
• New binary Euclidean algorithms 👍 👎
• Analysis of fast versions of the Euclid Algorithm 👍 👎

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)