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

Anomalous interface degradation of a-Si:H TFTs during LCD lifetime

Frank R. Libsch, Takatoshi Tsujimura

Active Matrix Liquid Crystal Displays Technology and Applications 1997

Conference paper

Characterization of line width variation

Alfred K. Wong, Antoinette F. Molless, et al.

SPIE Advanced Lithography 2000

Talk

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization

Trang H. Tran, Lam Nguyen, et al.

INFORMS 2022

Conference paper

Characterization of a next generation step-and-scan system

Timothy J. Wiltshire, Joseph P. Kirk, et al.

SPIE Advanced Lithography 1998

View all publications

Abstract

Related

Anomalous interface degradation of a-Si:H TFTs during LCD lifetime

Characterization of line width variation

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization

Characterization of a next generation step-and-scan system