A new approach to primary decomposition

DOI10.1006/jsco.2000.1017zbMath0970.68199OpenAlexW2058718484MaRDI QIDQ5928893

Alain Sausse

Publication date: 12 June 2001

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

Full work available at URL: https://semanticscholar.org/paper/1b984b7c4660e7e97f4f9d723fcd373880f9e63f

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over commutative rings (13B25)

Related Items (4)

The decision of prime and primary ideal ⋮ Normal projection: deterministic and probabilistic algorithms ⋮ A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals ⋮ Primary decomposition of zero-dimensional ideals over finite fields

Cites Work

• Gröbner bases and primary decomposition of polynomial ideals
• Direct methods for primary decomposition
• Ideal basis and primary decompositions: case of two variables
• The decomposition theorem for ideals in polynomial rings over a domain
• Constructions in a Polynomial Ring Over the Ring of Integers
• Unnamed Item

This page was built for publication: A new approach to primary decomposition