Skip to Main content Skip to Navigation
Journal articles

Accelerated tower arithmetic

Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01788403
Contributor : Joris van der Hoeven <>
Submitted on : Saturday, November 28, 2020 - 10:14:15 PM
Last modification on : Tuesday, December 1, 2020 - 3:44:02 AM

File

tower.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Joris van der Hoeven, Grégoire Lecerf. Accelerated tower arithmetic. Journal of Complexity, Elsevier, 2019, ⟨10.1016/j.jco.2019.03.002⟩. ⟨hal-01788403v2⟩

Share

Metrics

Record views

14

Files downloads

34