Accelerated tower arithmetic - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Complexity Année : 2019

Accelerated tower arithmetic

Résumé

Nowadays, asymptotically fast algorithms are widely used in computer algebra for computations in towers of algebraic field extensions of small height. Yet it is still unknown how to reach softly linear time for products and inversions in towers of arbitrary height. In this paper we design the first algorithm for general ground fields with a complexity exponent that can be made arbitrarily close to one from the asymptotic point of view. We deduce new faster algorithms for changes of tower representations, including the computation of primitive element representations in subquadratic time.
Fichier principal
Vignette du fichier
tower.pdf (381.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01788403 , version 1 (09-05-2018)
hal-01788403 , version 2 (28-11-2020)

Identifiants

Citer

Joris van der Hoeven, Grégoire Lecerf. Accelerated tower arithmetic. Journal of Complexity, 2019, 55, pp.101402. ⟨10.1016/j.jco.2019.03.002⟩. ⟨hal-01788403v2⟩
226 Consultations
376 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More