James Lee Hafner
Journal of Number Theory
Paper
Irreducible decomposition of polynomial ideals
Abstract
In this paper we present some algorithms for computing an irreducible decomposition of an ideal in a polynomial ring R = K[x1,..., xn] where K is an arbitrary effective field. © 2005 Elsevier Ltd. All rights reserved.
Related
Nimrod Megiddo
Journal of Symbolic Computation
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
A.R. Conn, Nick Gould, et al.
Mathematics of Computation