Pages that link to "Item:Q1111629"
From MaRDI portal
The following pages link to Computing a Gröbner basis of a polynomial ideal over a Euclidean domain (Q1111629):
Displaying 35 items.
- Standard bases in mixed power series and polynomial rings over rings (Q321289) (← links)
- Effective computation of strong Gröbner bases over Euclidean domains (Q372163) (← links)
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices (Q504418) (← links)
- Reduced Gröbner bases in polynomial rings over a polynomial ring (Q626887) (← links)
- An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors (Q626888) (← links)
- The F\(_{4}\)-algorithm for Euclidean rings (Q632251) (← links)
- Non-commutative Gröbner bases in algebras of solvable type (Q752147) (← links)
- A signature-based algorithm for computing Gröbner bases over principal ideal domains (Q782709) (← links)
- Dynamical Gröbner bases (Q855700) (← links)
- On the D-bases of polynomial ideals over principal ideal domains (Q1118398) (← links)
- Shirshov composition techniques in Lie superalgebras (noncommutative Gröbner bases) (Q1126540) (← links)
- Using Gröbner bases for detecting polynomial identities: A case study on Fermat's ideal (Q1199983) (← links)
- On lucky ideals for Gröbner basis computations (Q1209625) (← links)
- On Gröbner bases under specialization (Q1311607) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- A two-dimensional improvement for Farr-Gao algorithm (Q1691951) (← links)
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\) (Q1725693) (← links)
- A general framework for Noetherian well ordered polynomial reductions (Q2000264) (← links)
- Toward involutive bases over effective rings (Q2025443) (← links)
- Standard bases over Euclidean domains (Q2200296) (← links)
- Efficient Gröbner bases computation over principal ideal rings (Q2211184) (← links)
- An extension of Gröbner basis theory to indexed polynomials without eliminations (Q2220440) (← links)
- GVW algorithm over principal ideal domains (Q2440326) (← links)
- Gröbner bases with coefficients in rings (Q2466868) (← links)
- Computation of left Gröbner basis in solvable polynomial algebras on \(K(\vartheta)\) (Q2924571) (← links)
- Computing Gröbner bases of ideal in \(\mathbb Z[\alpha] [x_1,\cdots, x_n]\) over \(\mathbb Z\) (Q2927400) (← links)
- Semi-ring Based Gröbner–Shirshov Bases over a Noetherian Valuation Ring (Q3294667) (← links)
- Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I (Q3839878) (← links)
- Ideal membership in polynomial rings over the integers (Q4461098) (← links)
- Buchberger's algorithm: A constraint-based completion procedure (Q5096314) (← links)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Q5898584) (← links)
- Signature Gröbner bases in free algebras over rings (Q6060387) (← links)
- Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties (Q6135743) (← links)
- Strong Gröbner bases and linear algebra in multivariate polynomial rings over Euclidean domains (Q6656077) (← links)
- On two signature variants of Buchberger's algorithm over principal ideal domains (Q6666529) (← links)
