Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9652875 | Journal of Symbolic Computation | 2005 | 12 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
E. Fortuna, P. Gianni, B. Trager,