On the complexity of computing with zero-dimensional triangular sets

Adrien Poteaux, Éric Schost

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…