The termination of the F5 algorithm revisited

  title={The termination of the F5 algorithm revisited},
  author={Senshan Pan and Yupu Hu and Baocang Wang},
The F5 algorithm [8] is generally believed as one of the fastest algorithms for computing Gröbner bases. However, its termination problem is still unclear. The crux lies in the non-determinacy of the F5 in selecting which from the critical pairs of the same degree. In this paper, we construct a generalized algorithm F5GEN which contain the F5 as its concrete implementation. Then we prove the correct termination of the F5GEN algorithm. That is to say, for any finite set of homogeneous… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-6 of 6 references

A new conception for computing Gröbner basis and its applications

  • L. Huang
  • [cs.SC],
  • 2010
Highly Influential
6 Excerpts

On efficient computation of Gröbner bases

  • J. Gash
  • PhD thesis, Indiana University,
  • 2009
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…