A speed-up of the algorithm for computing comprehensive Gröbner systems
From MaRDI portal
Publication:5301685
Recommendations
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- An efficient method for computing comprehensive Gröbner bases
- A new algorithm for computing comprehensive Gröbner systems
- Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously
- Comprehensive Gröbner bases
Cited in
(24)- An Improvement of Rosenfeld-Gröbner Algorithm
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
- Algorithmic detection of conserved quantities for finite-difference schemes
- Improvement of an incremental signature-based comprehensive Gröbner system algorithm
- Generic regular decompositions for parametric polynomial systems
- Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously
- An improvement of the rational representation for high-dimensional systems
- Automated reducible geometric theorem proving and discovery by Gröbner basis method
- Generic regular decompositions for generic zero-dimensional systems
- A new algorithm for computing comprehensive Gröbner systems
- A Study on Gröbner Basis with Inexact Input
- A parametric \(\mathrm{F}_4\) algorithm
- On the computation of parametric Gröbner bases for modules and syzygies
- On multivariate Hermitian quadratic forms
- Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules
- Generalizing the Steiner-Lehmus theorem using the Gröbner cover
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Parametric FGLM algorithm
- On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems
- Merging multiple algorithms for computing comprehensive Gröbner systems using parallel processing
- Comprehensive characteristic decomposition of parametric polynomial systems
- Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
This page was built for publication: A speed-up of the algorithm for computing comprehensive Gröbner systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301685)
