Faugère's F4 and F5 algorithms
id:
faug-re-s-f4-and-f5-algorithms-260-2684252
title:
Faugère's F4 and F5 algorithms
text:
In computer algebra, the Faugère F4 algorithm, by Jean-Charles Faugère, computes the Gröbner basis of an ideal of a multivariate polynomial ring. 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 reductions in parallel. The Faugère F5 algorithm first calculates the Gröbner basis of a pair of generator polynomials of the ideal. Then it uses this basi
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Faug%C3%A8re%27s_F4_and_F5_algorithms
date created:
date modified:
2023-11-29T18:02:38Z
main entity:
{"identifier":"Q5438075","url":"https://www.wikidata.org/entity/Q5438075"}
image:
fields total:
13
integrity:
13