On radical zero-dimensional ideals

DOI10.1016/S0747-7171(89)80060-4zbMath0693.68020OpenAlexW2052005674MaRDI QIDQ908690

Hidetsune Kobayashi, Shuichi Moritsugu, Robert W. Hogan

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(89)80060-4

zbMATH Keywords

algorithmGröbner bases

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials over commutative rings (13B25) Software, source code, etc. for problems pertaining to computer science (68-04)

Related Items

On non-binomial structure of cyclic 8-roots ⋮ Computation of real radicals of polynomial ideals. II ⋮ On the computation of matrices of traces and radicals of ideals ⋮ Fast theorem-proving and Wu's method ⋮ Mechanical geometry theorem proving based on Gröbner bases ⋮ An algorithm for solving parametric linear systems ⋮ Solutions of systems of algebraic equations and linear maps on residue class rings

Cites Work

• Unnamed Item
• Unnamed Item
• Gröbner bases and primary decomposition of polynomial ideals
• Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• On improving approximate results of Buchberger's algorithm by Newton's method

This page was built for publication: On radical zero-dimensional ideals