Fast computation of Gröbner bases of ideals of F[x, y]

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.