New fast Euclidean algorithms
type: Item
instance of: scholarly article
title: New fast Euclidean algorithms
zbMATH Open document ID: 1303.11130
author: Sidi Mohamed Sedjelmaci
author: Marie-Françoise Roy
published in: Journal of Symbolic Computation
publication date: 2013-01-10T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 13P05
zbMATH DE Number: 6124227
zbMATH Keywords: fast algorithms
zbMATH Keywords: greatest common divisor (gcd)
zbMATH Keywords: half-greatest common divisor (half-gcd)
zbMATH Keywords: quotient boot
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.jsc.2012.06.003
OpenAlex ID: W1983313113
DOI: 10.1016/J.JSC.2012.06.003
Recommended article: New binary Euclidean algorithms
Recommended article: Acceleration of Euclidean algorithm and extensions
Recommended article: Q3987501
Recommended article: Q4288322
Recommended article: A fast Euclidean algorithm for Gaussian integers
Recommended article: Acceleration of Euclidean Algorithm and Rational Number Reconstruction
Recommended article: Generalized Euclidean algorithms
Recommended article: Q4714222
Recommended article: Analysis of fast versions of the Euclid Algorithm
Recommended article: New fast algorithms for elliptic curve arithmetic in affine coordinates
description: scientific article; zbMATH DE number 6124227