The following pages link to (Q5301685):
Displaying 20 items.
- Parametric FGLM algorithm (Q512366) (← links)
- On the computation of parametric Gröbner bases for modules and syzygies (Q623733) (← links)
- On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems (Q748755) (← links)
- Generic regular decompositions for parametric polynomial systems (Q905159) (← links)
- Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules (Q1635280) (← links)
- Automated reducible geometric theorem proving and discovery by Gröbner basis method (Q1701040) (← links)
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases (Q1730311) (← links)
- An improvement of the rational representation for high-dimensional systems (Q2121180) (← links)
- Generalizing the Steiner-Lehmus theorem using the Gröbner cover (Q2229890) (← links)
- On multivariate Hermitian quadratic forms (Q2319444) (← links)
- Generic regular decompositions for generic zero-dimensional systems (Q2335932) (← links)
- Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm (Q2402230) (← links)
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form (Q2674009) (← links)
- A Study on Gröbner Basis with Inexact Input (Q3644104) (← links)
- Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system (Q6139279) (← links)
- A parametric \(\mathrm{F}_4\) algorithm (Q6571583) (← links)
- Improvement of an incremental signature-based comprehensive Gröbner system algorithm (Q6612108) (← links)
- Algorithmic detection of conserved quantities for finite-difference schemes (Q6653670) (← links)
- Merging multiple algorithms for computing comprehensive Gröbner systems using parallel processing (Q6660342) (← links)
- Comprehensive characteristic decomposition of parametric polynomial systems (Q6666527) (← links)
