Name
Abstract | ||
|---|---|---|
This paper provides a fast algorithm for Grobner bases of ideals of F[x, y] over a field F. We show that only the S-polynomials of neighbor pairs of a strictly ordered finite generating set are needed in the computing of a Groumlbner bases of the ideal. It reduces dramatically the number of unnecessary S-polynomials that are processed. Although the complexity of the algorithm is hard to evaluated, it obviously has a great improvement from Buchberger's Algorithm. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ISIT.2009.5205791 | ISIT |
Keywords | Field | DocType |
great improvement,finite generating set,fast computation,buchberger's algorithm,polynomial ideal,bner base,neighbor pair,fast algorithm,unnecessary s-polynomials,galois fields,s-polynomials,gröbner bases,polynomials,grobner bases fast computation,field f.,algorithm design and analysis,buchberger s algorithm,data mining,computer science,generators | Discrete mathematics,Finite field,Combinatorics,Algorithm design,Buchberger's algorithm,Algebra,Polynomial,Generating set of a group,Mathematics,Computation | Conference |
ISBN | Citations | PageRank |
978-1-4244-4313-0 | 0 | 0.34 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yindong Chen | 1 | 15 | 8.07 |
| Lu Yao | 2 | 118 | 22.09 |
| Peizhong Lu | 3 | 230 | 22.46 |