Complexity of triangular representations of algebraic sets (Q1714872)

One of the interesting and applied problems in computer algebra is representing the radical of a polynomial ideal. One of the main techniques developed in literature, for this purpose, is triangular decomposition. \textit{A. Szántó} in [Computation with polynomial systems. Ithaca, NY: Cornell University. PhD Thesis (1999), \url{http://www4.ncsu.edu/~aszanto/szanto.pdf}] proposed an algorithm for computing such a decomposition for a given ideal. In the paper under review, the authors present a complete bound on the degrees and the number of components of the decomposition calculated by this algorithm.