Computer algebra
Stockholm University
Stockholm
Start date:
End date:
Pace of study: 25 %
Published education catalogue
Education information from the published source. The education record and its time-bound offerings are kept separate.
Code: MM7025
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.
Admission to the course requires knowledge equivalent to 1. Computer Science for Mathematicians, 7.5 ECTS (DA3018) and Mathematics III - Abstract algebra, 7.5 ECTS (MM5020) or 2. Algorithms and Complexity, 7.5 ECTS (DA3004) and Mathematics II - Algebra and combinatorics, 7.5 ECTS (MM5013).
Each offering has its own dates and conditions. Closed offerings are retained as history and do not mean that a new application is open.
Stockholm University
Stockholm
Start date:
End date:
Pace of study: 25 %
Retrieved: .
Published: .
Publication version: 8e217193-f5fa-4778-b085-a4521fd03e8d
Checksum: 1b0dc54c0fc8a359f83ba9dc8f9d468479ce432de4c03bce3b8b33dd67fe3f6c
Last changed according to the source: 2026-09-11T14:56:36