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.
Author supplied keywords
Cite
CITATION STYLE
APA
Fortuna, E., Gianni, P., & Trager, B. (2005). Irreducible decomposition of polynomial ideals. Journal of Symbolic Computation, 39(3-4 SPEC. ISS.), 305–316. https://doi.org/10.1016/j.jsc.2004.11.005
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free