Irreducible decomposition of polynomial ideals

E. Fortuna; P. Gianni; B.M. Trager

doi:10.1016/j.jsc.2004.11.005

Journal of Symbolic Computation

Paper

01 Mar 2005

Irreducible decomposition of polynomial ideals

View publication

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.

Paper

Neural network based iterative learning control for product qualities in batch processes

Zhihua Xiong, Yixin Xu, et al.

International Journal of Modelling, Identification and Control

Conference paper

Channel coding considerations for wireless LANs

Daniel J. Costello Jr., Pierre R. Chevillat, et al.

ISIT 1997

Paper

Interactive scheduling as a constraint satisfiability problem

Ronen Feldman, Martin Charles Golumbic

Ann. Math. Artif. Intell.

Paper

A generic grouping algorithm and its quantitative analysis

Arnon Amir, Michael Lindenbaum

IEEE Transactions on Pattern Analysis and Machine Intelligence

View all publications

Abstract

Related

Neural network based iterative learning control for product qualities in batch processes

Channel coding considerations for wireless LANs

Interactive scheduling as a constraint satisfiability problem

A generic grouping algorithm and its quantitative analysis