Skip to Main content Skip to Navigation
Journal articles

On the complexity of computing with zero-dimensional triangular sets

Abstract : We study the complexity of some fundamental operations for triangular sets in dimension zero. Using Las Vegas algorithms, we prove that one can perform such operations as change of order, equiprojectable decomposition, or quasi-inverse computation with a cost that is essentially that of modular composition. Over an abstract field, this leads to a subquadratic cost (with respect to the degree of the underlying algebraic set). Over a finite field, in a boolean \RAM\ model, we obtain a quasi-linear running time using Kedlaya and Umansʼ algorithm for modular composition. Conversely, we also show how to reduce the problem of modular composition to change of order for triangular sets, so that all these problems are essentially equivalent. Our algorithms are implemented in Maple; we present some experimental results.
Document type :
Journal articles
Complete list of metadata

Cited literature [43 references]  Display  Hide  Download
Contributor : Adrien Poteaux Connect in order to contact the contributor
Submitted on : Friday, May 24, 2013 - 5:03:37 PM
Last modification on : Thursday, February 21, 2019 - 10:52:50 AM
Long-term archiving on: : Tuesday, April 4, 2017 - 11:17:08 AM


Files produced by the author(s)




Adrien Poteaux, Éric Schost. On the complexity of computing with zero-dimensional triangular sets. Journal of Symbolic Computation, Elsevier, 2013, 50, pp.110 - 138. ⟨10.1016/j.jsc.2012.05.008⟩. ⟨hal-00825847⟩



Les métriques sont temporairement indisponibles