Localization and Base Change Techniques in Computational Algebra
Krister Forsman · 1993
This report collects some useful results from commutative algebra and describes how they can be used to decrease the complexity in Gröbner base computations. As a byproduct we see how Gröbner bases relate to characteristic sets. The algorithms presented are well known but have, as far as the author knows not been collected in one place earlier.