Computing the primary decomposition of zero-dimensional ideals

DOI10.1006/jsco.2002.0571zbMath1010.13017OpenAlexW2087585092MaRDI QIDQ1864896

Chris Monico

Publication date: 23 March 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2002.0571

zbMATH Keywords

Gröbner basisprimary decomposition of ideal

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Ideals and multiplicative ideal theory in commutative rings (13A15)

Related Items (6)

An efficient algorithm for factoring polynomials over algebraic extension field ⋮ The decision of prime and primary ideal ⋮ Parallelization of modular algorithms ⋮ Normal projection: deterministic and probabilistic algorithms ⋮ Primary decomposition of zero-dimensional ideals over finite fields ⋮ Evaluation techniques for zero-dimensional primary decomposition

Cites Work

• Gröbner bases and primary decomposition of polynomial ideals
• Factoring polynomials with rational coefficients
• Direct methods for primary decomposition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the primary decomposition of zero-dimensional ideals