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.

Conference paper

Motion video analysis using planar parallax

Harpreet S. Sawhney

IS&T/SPIE Electronic Imaging 1994

Paper

Kinematic theory of signature verification measurements

John S. Lew

Mathematical Biosciences

Paper

Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs

Vladimir Yanovski, Israel A. Wagner, et al.

Ann. Math. Artif. Intell.

Paper

Dynamic graph and polynomial chaos based models for contact tracing data analysis and optimal testing prescription

Shashanka Ubaru, Lior Horesh, et al.

Journal of Biomedical Informatics

View all publications

Abstract

Related

Motion video analysis using planar parallax

Kinematic theory of signature verification measurements

Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs

Dynamic graph and polynomial chaos based models for contact tracing data analysis and optimal testing prescription