23 citations · 65 across the 12 of their papers we have counts for
12 papers
A Monomial-Oriented GVW for Computing Gröbner Bases
Yao Sun, Dingkang Wang, Zhenyu Huang +1
The GVW algorithm, presented by Gao et al., is a signature-based algorithm for computing Gröbner bases. In this paper, a variant of GVW is presented. This new algorithm is called a…
On the Efficiency of Solving Boolean Polynomial Systems with the Characteristic Set Method
Zhenyu Huang, Yao Sun, Dongdai Lin
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones b…
An Improvement over the GVW Algorithm for Inhomogeneous Polynomial Systems
Yao Sun, Dongdai Lin, Dingkang Wang
The GVW algorithm is a signature-based algorithm for computing Gröbner bases. If the input system is not homogeneous, some J-pairs with higher signatures but lower degrees are reje…
Analyzing the Dual Space of the Saturated Ideal of a Regular Set and the Local Multiplicities of its Zeros
Xiaoliang Li, Wei Niu
In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate…
Signature-Based Gröbner Basis Algorithms --- Extended MMM Algorithm for computing Gröbner bases
Yao Sun
Signature-based algorithms is a popular kind of algorithms for computing Gröbner bases, and many related papers have been published recently. In this paper, no new signature-based…
Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms
Yao Sun, Dingkang Wang
Signature-based algorithms are a popular kind of algorithms for computing Groebner basis, including the famous F5 algorithm, F5C, extended F5, G2V and the GVW algorithm. In this pa…