Stockholm university logo, link to start page
Gå till denna sida på svenska webben

Computer algebra

  • 7.5 credits

The course deals with computer algebraic aspects of polynomial rings by means of the theory of Gröbner bases.

The following topics and results are covered: ideals, Hilbert's basis theorem, affine varieties, Hilbert's nullstellensatz, monomial orderings, Gröbner bases, Buchberger's algorithm, elimination, quotient rings.

The course also includes an introduction to a modern computer algebra system (CAS) with focus on how to use it to solve applied problems from graph theory, theoretical computer science, and optimization.

Further course information will appear soon on this page. Until then, information can be found on the department website.