Minimal primary decomposition and factorized Gröbner bases
From MaRDI portal
Publication:1361005
DOI10.1007/s002000050064zbMath1055.13501OpenAlexW1978771104MaRDI QIDQ1361005
Publication date: 1997
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://ul.qucosa.de/id/qucosa%3A32790
Analysis of algorithms and problem complexity (68Q25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Grammars and rewriting systems (68Q42)
Related Items (6)
Syzygies probing scattering amplitudes ⋮ A signature-based algorithm for computing the nondegenerate locus of a polynomial system ⋮ The decision of prime and primary ideal ⋮ Normal projection: deterministic and probabilistic algorithms ⋮ Primary decomposition of zero-dimensional ideals over finite fields ⋮ On computing absolutely irreducible components of algebraic varieties with parameters
Uses Software
This page was built for publication: Minimal primary decomposition and factorized Gröbner bases
