Skip to Main content Skip to Navigation
Journal articles

Directed evaluation

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas
Contributor : Joris van der Hoeven <>
Submitted on : Saturday, November 28, 2020 - 10:30:56 PM
Last modification on : Thursday, December 3, 2020 - 3:30:20 AM


Files produced by the author(s)




Joris van der Hoeven, Grégoire Lecerf. Directed evaluation. Journal of Complexity, Elsevier, 2020, ⟨10.1016/j.jco.2020.101498⟩. ⟨hal-01966428v2⟩



Record views


Files downloads