The aim of the course is to introduce students to the concepts and most important techniques in computer algebra and symbolic computation, in particular conveying a fundamental understanding of non-linear arithmetic and computational approaches to related problems.

The students will learn how to apply these ideas in areas like SMT solving, formal verification and program analysis.

Ideals, Gröbner bases, polynomial arithmetic, semi-algebraic sets and cylindrical algebraic decomposition, algorithms for exact solutions of linear recurrence equations and differential equations.

The course consists of a lecture part and an exercise part. The final grade is determined by the exercises and an oral exam.

Ects Breakdown

28  h lectures
20  h lecture follow-up and further reading
14  h solving exercises
15  h preparation for oral exam
1 h exam
-----------------------------------------------
78 h = ca. 3 Ects