Computing bases of complete intersection rings in Noether position
- 24 August 2001
- journal article
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 162 (2-3) , 127-170
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- An algorithm for the Quillen-Suslin theorem for monoid ringsJournal of Pure and Applied Algebra, 1997
- Bounds for traces in complete intersections and degrees in the NullstellensatzApplicable Algebra in Engineering, Communication and Computing, 1995
- On the efficiency of effective Nullstellens tzecomputational complexity, 1993
- Algorithmic aspects of Suslin's proof of Serre's conjecturecomputational complexity, 1993
- Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen‐Suslin) pour le Calcul FormelMathematische Nachrichten, 1990
- Bounds for the degrees in the division problem.The Michigan Mathematical Journal, 1990
- Sharp Effective NullstellensatzJournal of the American Mathematical Society, 1988
- Parallel arithmetic computations: A survey1986
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983
- The complexity of the word problems for commutative semigroups and polynomial idealsAdvances in Mathematics, 1982