An alternative approach to comprehensive Gröbner bases

From MaRDI portal
Publication:1878492

DOI10.1016/S0747-7171(03)00098-1zbMath1053.13013MaRDI QIDQ1878492

Yosuke Sato, Akira Suzuki

Publication date: 20 August 2004

Published in: Journal of Symbolic Computation (Search for Journal in Brave)




Related Items

Gröbner systems conversionTesting binomiality of chemical reaction networks using comprehensive Gröbner systemsExploring the potential energy landscape over a large parameter-spaceComprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithmGröbner bases for polynomial systems with parametersAutomatic deduction in (dynamic) geometry: Loci computationAn extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith formSolving the perspective-three-point problem using comprehensive Gröbner systemsOn the computation of parametric Gröbner bases for modules and syzygiesGeneric Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner systemBoolean Gröbner basesAutomated reducible geometric theorem proving and discovery by Gröbner basis methodA survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner basesImproving the DISPGB algorithm using the discriminant idealGröbner bases for families of affine or projective schemesMinimal polynomial systems for parametric matricesAlgebraic local cohomology with parameters and parametric standard bases for zero-dimensional idealsOn the Computation of Elimination Ideals of Boolean Polynomial RingsComprehensive Gröbner Bases in a Java Computer Algebra SystemMinimal canonical comprehensive Gröbner systemsOn the Computation of Comprehensive Boolean Gröbner BasesOn Parametric Border BasesCSSg method for several genericities of parametric systems



Cites Work