An efficient method for computing comprehensive Gröbner bases
From MaRDI portal
Publication:1940934
DOI10.1016/j.jsc.2012.05.015zbMath1283.13024OpenAlexW2148498573MaRDI QIDQ1940934
Deepak Kapur, Ding-Kang Wang, Yao Sun
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
Related Items
A Design and an Implementation of an Inverse Kinematics Computation in Robotics Using Gröbner Bases, Gröbner systems conversion, Testing binomiality of chemical reaction networks using comprehensive Gröbner systems, Exploring the potential energy landscape over a large parameter-space, Computing comprehensive Gröbner systems: a comparison of two methods, Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm, Resultant elimination via implicit equation interpolation, On the computation of the Galois group of linear difference equations, The Generalized Rabinowitsch Trick, A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases, Parametric FGLM algorithm, Invariant algebraic sets and symmetrization of polynomial systems, Equations of Riemann surfaces with automorphisms, CSSg method for several genericities of parametric systems
Uses Software
