The question of finitely many steps in polynomial ideal theory
ACM SIGSAM Bulletin
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Some properties of Gröbner-bases for polynomial ideals
ACM SIGSAM Bulletin
| Hi-index | 0.00 |
An algorithm of Bruno Buchberger's is extended to polynomial rings over a Noetherian ring. In a specialized version, it can be used for computing elimination ideals. Over fields, it provides the determination of the minimal prime ideals which contain the given ideal, except that the primeness must be proved with other methods. Estimates for computing time are not given.