The F4 Algorithm for Computing Groebner Bases

October 25 2005 roman_pearce 1573
I've released a Maple implementation of the F4 algorithm for computing Groebner bases. You can download it from the Maple Application Center here, or from my personal webpage here. The code requires Maple 10. It's faster than the Groebner[Basis] command for total degree orders, and it can be run in non-commutative algebras too. The coefficients are restricted to rational numbers or the integers mod p with p

Please Wait...