scientific article; zbMATH DE number 3899033
From MaRDI portal
Publication:3677849
Recommendations
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Effective computation of strong Gröbner bases over Euclidean domains
- Gröbner bases in orders of algebraic number fields.
- Computing Gröbner bases of ideal in \(\mathbb Z[\alpha] [x_1,\cdots, x_n]\) over \(\mathbb Z\)
- An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors
Cited in
(40)- Computer algebra: Past and future
- History and basic features of the critical-pair/completion procedure
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- A refutational approach to geometry theorem proving
- Shirshov composition techniques in Lie superalgebras (noncommutative Gröbner bases)
- Using Gröbner bases for detecting polynomial identities: A case study on Fermat's ideal
- Groebner basis under composition. I
- A categorical critical-pair completion algorithm
- On Gröbner bases under specialization
- A solution to Kronecker's problem
- Computational ideal theory in finitely generated extension rings
- Gröbner bases in orders of algebraic number fields.
- Standard bases over Euclidean domains
- Efficient Gröbner bases computation over principal ideal rings
- On the modular computation of Gröbner bases with integer coefficients
- Zacharias representation of effective associative rings
- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
- Strong Gröbner bases for polynomials over a principal ideal ring.
- Computing Gröbner bases of ideal in \(\mathbb Z[\alpha] [x_1,\cdots, x_n]\) over \(\mathbb Z\)
- Standard bases in mixed power series and polynomial rings over rings
- Algorithmic aspects of Z[x1,…,xn] with applications to tiling problems
- scientific article; zbMATH DE number 5375015 (Why is no real title available?)
- Effective computation of strong Gröbner bases over Euclidean domains
- scientific article; zbMATH DE number 1254275 (Why is no real title available?)
- scientific article; zbMATH DE number 1254278 (Why is no real title available?)
- scientific article; zbMATH DE number 1163437 (Why is no real title available?)
- scientific article; zbMATH DE number 2102751 (Why is no real title available?)
- Generalized Gröbner bases: Theory and applications. A condensation
- On signature-based Gröbner bases over Euclidean rings
- Applications of strong Gröbner bases over Euclidean domains
- Algorithms for construction of standard Gröbner-Shirshov bases of ideals of free algebras over commutative rings
- Reduced Gröbner bases in polynomial rings over a polynomial ring
- An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors
- The F\(_{4}\)-algorithm for Euclidean rings
- Algorithms for computing multiplier ideals
- Strong Gröbner bases and linear algebra in multivariate polynomial rings over Euclidean domains
- Pivoting in extended rings for computing approximate Gröbner bases
- Non-commutative Gröbner bases in algebras of solvable type
- The reduction ring property is hereditary
- On the construction of Gröbner bases using syzygies
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 Q3677849)
