Pages that link to "Item:Q3450045"
From MaRDI portal
The following pages link to A new framework for computing Gröbner bases (Q3450045):
Displaying 27 items.
- A signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings. (Q317652) (← links)
- A new proof for the correctness of the F5 algorithm (Q365812) (← links)
- Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases (Q382761) (← links)
- An improvement over the GVW algorithm for inhomogeneous polynomial systems (Q530403) (← links)
- Solving the 100 swiss francs problem (Q691647) (← links)
- A signature-based algorithm for computing Gröbner bases over principal ideal domains (Q782709) (← links)
- Computing comprehensive Gröbner systems: a comparison of two methods (Q1650394) (← links)
- A survey on signature-based algorithms for computing Gröbner bases (Q1711995) (← links)
- Characteristic decomposition: from regular sets to normal sets (Q1730299) (← links)
- Speeding up the GVW algorithm via a substituting method (Q1730310) (← links)
- An involutive GVW algorithm and the computation of Pommaret bases (Q2051592) (← links)
- Relative Gröbner and involutive bases for ideals in quotient rings (Q2051594) (← links)
- Solving multivariate polynomial matrix Diophantine equations with Gröbner basis method (Q2121216) (← links)
- An improvement for GVW (Q2121217) (← links)
- Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra (Q2133928) (← links)
- Computing coupled border bases (Q2183743) (← links)
- Computing strong regular characteristic pairs with Gröbner bases (Q2229717) (← links)
- The LaSalle's invariant sets for a class of Lotka-Volterra prey-predator chain systems (Q2633776) (← links)
- A new algorithm for computing staggered linear bases (Q2687265) (← links)
- Improved Computation of Involutive Bases (Q2829991) (← links)
- Decomposition of polynomial sets into characteristic pairs (Q4960083) (← links)
- Finding Fuzzy Inverse Matrix Using Wu’s Method (Q5076676) (← links)
- On the construction of staggered linear bases (Q5157738) (← links)
- Randomized polynomial-time root counting in prime power rings (Q5235106) (← links)
- A signature-based algorithm for computing the nondegenerate locus of a polynomial system (Q6108370) (← links)
- Axioms for a theory of signature bases (Q6149142) (← links)
- Counting roots for polynomials modulo prime powers (Q6165864) (← links)