Faugère's F4 and F5 algorithms

In computer algebra, the Faugère F4 algorithm computes the Gröbner basis of an ideal of multivariate polynomials. The algorithm uses the same mathematical principles as the Buchberger algorithm, but computes many normal forms in one go by forming a generally sparse matrix and using fast linear algebra to do the reduction.