Subexponential-time computation of isolated primary components of a polynomial ideal

DOI10.1007/s10958-021-05357-8zbMath1465.13023OpenAlexW3155240305MaRDI QIDQ2027324

Alexander L. Chistov

Publication date: 26 May 2021

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-021-05357-8

zbMATH Keywords

primary decompositionisolated primary component

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Localization and primary decomposition of polynomial ideals
• Résolution des systèmes d'équations algébriques
• Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
• Primary decomposition: Compatibility, independence and linear growth
• Inequalities for Hilbert functions and primary decompositions
• Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal
• Constructions in Algebra
• New Algorithms for Computing Primary Decomposition of Polynomial Ideals

This page was built for publication: Subexponential-time computation of isolated primary components of a polynomial ideal