The F4 and F5 Algorithms for Computing Groebner Bases

Roman Pearce, CECM, SFU

Friday November 18th, 2005 at 10:30am in K9509.

Abstract: 

In this talk we will introduce the F4 and F5 algorithms, which
are the current "state-of-the-art" methods for computing Groebner bases.
We will discuss the known strategies for improving the performance of the
algorithms, including those used by Magma and J.C. Faugere.  Finally we
will show how to extend both algorithms to express the Groebner basis
in terms of the input.