PGB

swMATH704MaRDI QIDQ13458FDOQ13458

Author name not available (Why is that?)

Cited In (24)

• A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
• An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
• An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form
• A speed-up of the algorithm for computing comprehensive Gröbner systems
• Comprehensive Gröbner Bases in a Java Computer Algebra System
• Parametric Solvable Polynomial Rings and Applications
• Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
• Comprehensive Gröbner systems in PBW algebras, Bernstein-Sato ideals and holonomic \(D\)-modules
• An Algorithm for Computing the Truncated Annihilating Ideals for an Algebraic Local Cohomology Class
• Higgs as a holographic pseudo-Goldstone boson
• Generic regular decompositions for parametric polynomial systems
• Comprehensive Gröbner bases in a Java computer algebra system
• A partitioning gradient based (PGB) algorithm for solving nonlinear goal programming problems
• Generalizing the Steiner-Lehmus theorem using the Gröbner cover
• On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems
• An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
• On the computation of parametric Gröbner bases for modules and syzygies
• A Study on Gröbner Basis with Inexact Input
• The mathematics of photonic crystals
• Parametric FGLM algorithm
• Computation of inverses in residue class rings of parametric polynomial ideals
• Automated reducible geometric theorem proving and discovery by Gröbner basis method
• On multivariate Hermitian quadratic forms
• Generic regular decompositions for generic zero-dimensional systems

This page was built for software: PGB