scientific article; zbMATH DE number 3870585
zbMATH Open0546.68021MaRDI QIDQ3336682FDOQ3336682
Authors: Bruno Buchberger 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
- An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank
- Computational ideal theory in finitely generated extension rings
- An algorithm for unimodular completion over noetherian rings
- An algorithm to generate the ideals of a partial order
- An algorithmic approach to the existence of ideal objects in commutative algebra
- Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm
- scientific article; zbMATH DE number 1071735
- An algorithm for producing F-pure ideals
- Completion of Factor Algebras of Ideals
- Computing intersections, dual and divisorial closure of ideals in a class of rings
ideal membership problempolynomial ideal theoryGröbner-basiscanonical simplification problem modulo idealscritical-pair/completion algorithmuniform word problem for finitely generated commutative rings
Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials over commutative rings (13B25) Ideals and multiplicative ideal theory in commutative rings (13A15) Polynomials and finite commutative rings (13M10)
Cited In (23)
- Gröbner bases in orders of algebraic number fields.
- Buchberger's algorithm: The term rewriter's point of view
- Title not available (Why is that?)
- A survey on signature-based algorithms for computing Gröbner bases
- Classification of three-dimensional covariant differential calculi on Podles' quantum spheres and on related spaces
- A generalization of reduction rings
- Gröbner bases with coefficients in rings
- Lifting canonical algorithms from a ring R to the ring R[x]
- Symideal Gröbner bases
- On the D-bases of polynomial ideals over principal ideal domains
- Mathematical Theory Exploration in Theorema: Reduction Rings
- Algorithm 628
- On lucky ideals for Gröbner basis computations
- Title not available (Why is that?)
- History and basic features of the critical-pair/completion procedure
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
- On the construction of Gröbner bases using syzygies
- Dynamical Gröbner bases over Dedekind rings
- Generalized Gröbner bases: Theory and applications. A condensation
- Sistemi normali di generatori per gli ideali di \(Z[X]\)
- Critical pair criteria for completion
- Combining equational reasoning
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3336682)
