Complexity of triangular representations of algebraic sets (Q1714872)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of triangular representations of algebraic sets |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of triangular representations of algebraic sets |
scientific article |
Statements
Complexity of triangular representations of algebraic sets (English)
0 references
1 February 2019
0 references
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.
0 references
triangular set
0 references
unmixed algebraic set
0 references
regular chain
0 references
radical polynomial ideal
0 references
Gröbner basis
0 references
complexity
0 references
0 references
0 references
0 references
0.8509336113929749
0 references
0.8428835272789001
0 references
0.828647255897522
0 references
0.8232385516166687
0 references
