Modular composition via complex roots - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2017

Modular composition via complex roots


Modular composition is the problem to compute the composition of two univariate polynomials modulo a third one. For polynomials with coefficients in a finite field, Kedlaya and Umans proved in 2008 that the theoretical complexity for performing this task could be made arbitrarily close to linear. Unfortunately, beyond its major theoretical impact, this result has not led to practically faster implementations yet. In this paper, we explore the particular case when the ground field is the field of computable complex numbers. Ultimately, when the precision becomes sufficiently large, we show that modular compositions may be performed in softly linear time.
Fichier principal
Vignette du fichier
zcomp.pdf (200.59 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01455731 , version 1 (03-02-2017)
hal-01455731 , version 2 (27-03-2017)


  • HAL Id : hal-01455731 , version 2


Joris van der Hoeven, Grégoire Lecerf. Modular composition via complex roots. 2017. ⟨hal-01455731v2⟩
349 View
116 Download


Gmail Mastodon Facebook X LinkedIn More