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

Total Source Mask Optimization: High-capacity, resist modeling, and production-ready mask solution

Moutaz Fakhry, Yuri Granik, et al.

SPIE Photomask Technology + EUV Lithography 2011

Paper

On some properties of contracting matrices

Chai Wah Wu

Linear Algebra and Its Applications

Paper

Classification with nonmetric distances: Image retrieval and class representation

David W. Jacobs, Daphna Weinshall, et al.

IEEE Transactions on Pattern Analysis and Machine Intelligence

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

Total Source Mask Optimization: High-capacity, resist modeling, and production-ready mask solution

On some properties of contracting matrices

Classification with nonmetric distances: Image retrieval and class representation

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