Algorithmic Properties of Polynomial Rings

M. KALKBRENER
1998 Journal of symbolic computation  
In this paper we investigate how algorithms for computing heights, radicals, unmixed and primary decompositions of ideals can be lifted from a Noetherian commutative ring R to polynomial rings over R.
doi:10.1006/jsco.1998.0227 fatcat:lmw5uzaf6zddxfcsfb7mxfl2ai