We explain what Groebner bases are, why they are interesting, and how they are computed. The focus of the talk is on computational aspects. We will therefore not say much about how Groebner bases can be used for solving all sorts of problems in commutative algebra. Instead, after discussing the classical Buchberger algorithm for computing Groebner basis, we will try to sketch the underlying ideas of more recent algorithms.
Sprache der Kurzfassung:
Hauptvortrag / Eingeladener Vortrag auf einer Tagung