arXiv · 1609.09824
Complexity of Triangular Representations of Algebraic Sets
Abstract
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the degrees of the polynomials and the number of components in the output of the algorithm, providing explicit formulas for these bounds.
Explore related subjects
Keep this discovery
Eli Amzallag, Gleb Pogudin, Mengxiao Sun, Thieu N. Vo. 2016-09-30. Complexity of Triangular Representations of Algebraic Sets. https://arxiv.org/abs/1609.09824
Cite the original work for its findings. Save a collection to share your selection of sources.