Subexponential-time computation of isolated primary components of a polynomial ideal (Q2027324)
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: Subexponential-time computation of isolated primary components of a polynomial ideal |
scientific article; zbMATH DE number 7351197
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subexponential-time computation of isolated primary components of a polynomial ideal |
scientific article; zbMATH DE number 7351197 |
Statements
Subexponential-time computation of isolated primary components of a polynomial ideal (English)
0 references
26 May 2021
0 references
Let \(K\) be a field and \(I\subset K[x_1,\ldots,x_n]\) an ideal. An algorithm is given to compute all isolated primary components of \(I\). The complexity of this algorithm is subexponential in the size of the input data.
0 references
primary decomposition
0 references
isolated primary component
0 references
0 references
0 references
0.8950798
0 references
0.8883089
0 references
0.88825655
0 references
0.87590516
0 references
0.8745793
0 references
0.8733487
0 references
