Subexponential-time computation of isolated primary components of a polynomial ideal
From MaRDI portal
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.
Recommendations
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- New algorithms for computing primary decomposition of polynomial ideals
- Some complexity results for polynomial ideals
- scientific article; zbMATH DE number 177888
- scientific article; zbMATH DE number 3893304
- On the parallel complexity of the polynomial ideal membership problem
- Subquadratic-time factoring of polynomials over finite fields
- scientific article; zbMATH DE number 1263216
- Approximate computation of zero-dimensional polynomial ideals
Cites work
- Constructions in Algebra
- Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal
- scientific article; zbMATH DE number 1302473 (Why is no real title available?)
- scientific article; zbMATH DE number 3893304 (Why is no real title available?)
- scientific article; zbMATH DE number 3220412 (Why is no real title available?)
- Inequalities for Hilbert functions and primary decompositions
- Localization and primary decomposition of polynomial ideals
- New algorithms for computing primary decomposition of polynomial ideals
- Primary decomposition: Compatibility, independence and linear growth
- Résolution des systèmes d'équations algébriques
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
Cited in
(2)
This page was built for publication: Subexponential-time computation of isolated primary components of a polynomial ideal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2027324)
