@inbook {IOPORT.05500473,
    author       = {Hashemi, Amir},
    title        = {Efficient algorithms for computing Noether normalization.},
    year         = {2008},
    booktitle    = {Computer mathematics. 8th Asian symposium, ASCM 2007, Singapore, December 15--17, 2007. Revised and invited papers},
    isbn         = {978-3-540-87826-1},
    pages        = {97-107},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/978-3-540-87827-8_8},
    abstract     = {Summary: In this paper, we provide first a new algorithm for testing whether a monomial ideal is in Noether position or not, without using its dimension, within a complexity which is quadratic in input size. Using this algorithm, we provide also a new algorithm to put an ideal in this position within an incremental (one variable after the other) random linear change of the last variables without using its dimension. We describe a modular (probabilistic) version of these algorithms for any ideal using the modular method used in [{\it E. A. Arnold}, ``Modular algorithms for computing Gr\"obner bases'', J. Symb. Comput. 35, No. 4, 403--419 (2003; Zbl 1046.13018)] with some modifications. These algorithms have been implemented in the distributed library noether.lib [{\it A. Hashemi}, ``noether.lib. A singular 3.0.3 distributed library for computing the n\oe ther normalization'' (2007)] of Singular, and we evaluate their performance via some examples.},
    identifier   = {05500473},
}