Abstract: Algorithms for
computing Groebner bases are in the core of all computer algebra
systems. One of the fastest installations of a Groebner method is F4
produced by Faugere and makes use of fast linear algebra. Its
modification, F5, has been claimed to crack certain examples
intractable by other methods. But what is behind F4 and F5?
...Back to the IMA postdoc