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

Lithographic characteristics of 193-nm resists imaged at 193 and 248 nm

Juliann Opitz, Robert D. Allen, et al.

Microlithography 1998

Conference paper

Effects of KrF laser radiation on fused-silica glass: a comparison of samples exposed in air vs vacuum

I.K. Pour, D.J. Krajnovich, et al.

SPIE Optical Materials for High Average Power Lasers 1992

Paper

Quantum Simulators: Architectures and Opportunities

Ehud Altman, Kenneth R. Brown, et al.

PRX Quantum

Paper

On the distance to the zero-set of a polynomial

Matthew A Grayson

Journal of Complexity

View all publications

Abstract

Related

Lithographic characteristics of 193-nm resists imaged at 193 and 248 nm

Effects of KrF laser radiation on fused-silica glass: a comparison of samples exposed in air vs vacuum

Quantum Simulators: Architectures and Opportunities

On the distance to the zero-set of a polynomial