Directed evaluation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Complexity Année : 2020

Directed evaluation

Résumé

Let be a fixed effective field. The most straightforward approach to compute with an element in the algebraic closure of is to compute modulo its minimal polynomial. The determination of a minimal polynomial from an arbitrary annihilator requires an algorithm for polynomial factorization over. Unfortunately, such algorithms do not exist over generic effective fields. They do exist over fields that are explicitly generated over their prime sub-field, but they are often expensive. The dynamic evaluation paradigm, introduced by Duval and collaborators in the eighties, offers an alternative algorithmic solution for computations in the algebraic closure of. This approach does not require an algorithm for polynomial factorization, but it still suffers from a non-trivial overhead due to suboptimal recomputations. For the first time, we design another paradigm, called directed evaluation, which combines the conceptual advantages of dynamic evaluation with a good worst case complexity bound.
Fichier principal
Vignette du fichier
direval.pdf (518.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01966428 , version 1 (28-12-2018)
hal-01966428 , version 2 (28-11-2020)

Identifiants

Citer

Joris van der Hoeven, Grégoire Lecerf. Directed evaluation. Journal of Complexity, 2020, ⟨10.1016/j.jco.2020.101498⟩. ⟨hal-01966428v2⟩
293 Consultations
193 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More