Computing bases of complete intersection rings in Noether position
DOI10.1016/S0022-4049(00)00135-3zbMath1029.13016MaRDI QIDQ5946450
Pablo Solernó, Marcela Almeida, Manuela Blaum, Lisi D'Alfonso
Publication date: 3 February 2004
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Quillen-Suslin theoremcomputing bases for complete intersection ringscomputing bases of free modulesNoether position
Software, source code, etc. for problems pertaining to commutative algebra (13-04) Projective and free modules and ideals in commutative rings (13C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Parallel algorithms in computer science (68W10)
Cites Work
- Degree bounds for the division problem in polynomial ideals
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
- On computing the determinant in small parallel time using a small number of processors
- Definability and fast quantifier elimination in algebraically closed fields
- Bounds for the degrees in the division problem
- Bounds for the degrees in the Nullstellensatz
- Recent improvements in the complexity of the effective Nullstellensatz
- The membership problem for unmixed polynomial ideals is solvable in single exponential time
- Algorithms for the Quillen-Suslin theorem
- Les courants residuels associes à une forme méromorphe
- Serre's conjecture
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
- On the degrees of bases of free modules over a polynomial ring
- Probabilistic algorithms for geometric elimination
- An algorithm for the Quillen-Suslin theorem for monoid rings
- Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz
- Straight-line programs in geometric elimination theory
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Algebraic Geometry. I: Complex projective varieties.
- Bounds of traces in complete intersections and degrees in the Nullstellensatz
- On the intrinsic complexity of the arithmetic Nullstellensatz
- Algorithmic aspects of Suslin's proof of Serre's conjecture
- On the efficiency of effective Nullstellensätze
- Residues and duality. Lecture notes of a seminar on the work of A. Grothendieck, given at Havard 1963/64. Appendix: Cohomology with supports and the construction of the \(f^!\) functor by P. Deligne
- Generic local structure of the morphisms in commutative algebra
- Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
- Ideals of generic minors
- Dénominateurs dans le théorème des zéros de Hilbert
- Sharp Effective Nullstellensatz
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing bases of complete intersection rings in Noether position