An efficient method for computing comprehensive Gröbner bases
From MaRDI portal
Publication:1940934
DOI10.1016/J.JSC.2012.05.015zbMATH Open1283.13024OpenAlexW2148498573MaRDI QIDQ1940934FDOQ1940934
Authors: Deepak Kapur, Yao Sun, Dingkang Wang 
Publication date: 11 March 2013
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2012.05.015
Recommendations
- Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously
- Comprehensive Gröbner bases
- scientific article; zbMATH DE number 2151245
- An algorithm to check whether a basis of a parametric polynomial system is a comprehensive Gröbner basis and the associated completion algorithm
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
Cited In (49)
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
- An algorithm to check whether a basis of a parametric polynomial system is a comprehensive Gröbner basis and the associated completion algorithm
- Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system
- Canonical comprehensive Gröbner bases
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- A design and an implementation of an inverse kinematics computation in robotics using Gröbner bases
- Practical Gröbner basis computation
- CSSg method for several genericities of parametric systems
- A speed-up of the algorithm for computing comprehensive Gröbner systems
- Parametric standard bases and their applications
- Stability conditions of monomial bases and comprehensive Gröbner systems
- Title not available (Why is that?)
- Gröbner systems conversion
- Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
- Testing binomiality of chemical reaction networks using comprehensive Gröbner systems
- Computer Algebra in Scientific Computing
- Invariant algebraic sets and symmetrization of polynomial systems
- On the Computation of Comprehensive Boolean Gröbner Bases
- Solving parametric ideal membership problems and computing integral numbers in a ring of convergent power series via comprehensive Gröbner systems
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Title not available (Why is that?)
- Exploring the potential energy landscape over a large parameter-space
- Computing comprehensive Gröbner systems: a comparison of two methods
- Improvement of an incremental signature-based comprehensive Gröbner system algorithm
- A short proof for the parameter continuation theorem
- On the computation of the Galois group of linear difference equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal canonical comprehensive Gröbner systems
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- A new algorithm for computing comprehensive Gröbner systems
- Computing with parameterized varieties
- Equations of Riemann surfaces with automorphisms
- FGb: A Library for Computing Gröbner Bases
- An effective method for computing Grothendieck point residue mappings
- A new algorithm for Gröbner bases conversion
- Effective computation of strong Gröbner bases over Euclidean domains
- Resultant elimination via implicit equation interpolation
- Title not available (Why is that?)
- Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously
- Title not available (Why is that?)
- A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
- Parametric FGLM algorithm
- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
- Comprehensive involutive systems
- The generalized Rabinowitsch trick
- Pivoting in extended rings for computing approximate Gröbner bases
Uses Software
This page was built for publication: An efficient method for computing comprehensive Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940934)
