Subexponential-time computation of isolated primary components of a polynomial ideal
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.
scientific article; zbMATH DE number 7351197