Analysis of fast versions of the euclid algorithm - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2008

Analysis of fast versions of the euclid algorithm

Abstract

There exist fast variants of the gcd algorithm which are all based on principles due to Knuth and Sch¨onhage. On inputs of size n, these algorithms use a Divide and Conquer approach, perform FFT multiplications and stop the recursion at a depth slightly smaller than lg n. A rough estimate of the worst-case complexity of these fast versions provides the bound O(n(log n)2 log log n).
Fichier principal
Vignette du fichier
analco-10-12_-_copie.pdf (296.46 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00211424 , version 1 (21-01-2008)

Identifiers

  • HAL Id : hal-00211424 , version 1

Cite

Eda Cesaratto, Julien Clément, Benoît Daireaux, Loïck Lhote, Véronique Maume-Deschamps, et al.. Analysis of fast versions of the euclid algorithm. 2008. ⟨hal-00211424⟩
117 View
633 Download

Share

Gmail Facebook X LinkedIn More