Sparse FGLM algorithms

  title={Sparse FGLM algorithms},
  author={Jean-Charles Faug{\`e}re and Chenqi Mou},
  journal={J. Symb. Comput.},
Given a zero-dimensional ideal I ⊂ K[x1, . . . ,xn] of degreeD, the transformation of the ordering of its Gröbner basis from DRL to LEX is a key step in polynomial system solving and turns out to be the bottleneck of the whole solving process. Thus it is of crucial importance to design efficient algorithms to perform the change of ordering. The main contributions of this paper are several efficient methods for the change of ordering which take advantage of the sparsity of multiplication… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS
13 Citations
22 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 13 extracted citations


Publications referenced by this paper.
Showing 1-10 of 22 references

Using Algebraic Geometry

  • D. Cox, J. Little, D. O’Shea
  • Symbolic Computation
  • 1998
Highly Influential
13 Excerpts

Efficient computation of zero-dimensional Gröbner bases by change of ordering

  • Faug̀ere, J.-C, P. Gianni, D. Lazard, T. Mora
  • Journal of Symbolic Computation
  • 1993
Highly Influential
4 Excerpts

2004.́Etude des syst

  • M. Bardet
  • 2004
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…