Prof. Franz Winkler
Short Description
A theoretical introduction into the area of computer algebra is
presented. Some of the main topics will be algorithms for basic
algebraic domains (like integers, polynomials, finite fields,
algebraic extension fields), computation by homomorphic images using
the Chinese remainder algorithm, greatest common divisors of
polynomials, factorization of univariate polynomials over finite
fields, and the basic theory of Gröbner bases for polynomial ideals.
The course will follow the appropriate chapters in
F. Winkler: Polynomial Algorithms in Computer Algebra, SpringerVerlag Wien New York, 1996 (ISBN 3211827595)
Participants are expected to be acquainted with the basic notions in
algebra and algorithm theory.
In the exercise session (Übungen) the students will have to solve both
theoretical problems and practical problems with the help of some
computer algebra system.
Exercise Problems
Grades for exercise session (Postscript)
Final Exam (Vorlesungsklausur)
