Subexponential-time computation of isolated primary components of a polynomial ideal
type: Item
instance of: scholarly article
title: Subexponential-time computation of isolated primary components of a polynomial ideal
zbMATH Open document ID: 1465.13023
published in: Journal of Mathematical Sciences (New York)
publication date: 2021-05-26T00:00:00Z
review text: 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.
reviewed by: Gerhard Pfister
Mathematics Subject Classification ID: 13P10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 7351197
zbMATH Keywords: primary decomposition
zbMATH Keywords: isolated primary component
author: A. L. Chistov
MaRDI profile type: Publication
full work available at URL: s10958-021-05357-8
OpenAlex ID: W3155240305
cites work: Q5184990
cites work: Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
cites work: Inequalities for Hilbert functions and primary decompositions
cites work: Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal
cites work: Q4247789
cites work: Résolution des systèmes d'équations algébriques
cites work: New Algorithms for Computing Primary Decomposition of Polynomial Ideals
cites work: Q5509028
cites work: Constructions in Algebra
cites work: Localization and primary decomposition of polynomial ideals
cites work: Primary decomposition: Compatibility, independence and linear growth
DOI: 10.1007/S10958-021-05357-8
Recommended article: Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
Recommended article: New Algorithms for Computing Primary Decomposition of Polynomial Ideals
Recommended article: Some complexity results for polynomial ideals
Recommended article: Q4038771
Recommended article: Q5184990
Recommended article: On the parallel complexity of the polynomial ideal membership problem
Recommended article: Subquadratic-time factoring of polynomials over finite fields
Recommended article: Q4234088
Recommended article: Approximate computation of zero-dimensional polynomial ideals
Recommended article: Gradual sub-lattice reduction and a new complexity for factoring polynomials
description: scientific article; zbMATH DE number 7351197