Wintersemester 2008/2009
Prof. Franz Winkler
Dr. Günter Landsmann
Computeralgebra (326.017)
Time:   Tue 15:30  18:00 
Place:   HS 11 
First lecture:   Tue 7.10.2008, HS 11 
Klausur:   Tue 27.1.2009 
  17:15  19:15, HS 9 
  no books / ohne Unterlagen 
Klausurangaben:   kl.pdf 
Grades:   finalgrades.pdf 
Achtung Korrektur! 
Klausureinsicht:   Montag, 2.3.2009, 16:0017:00 
  Raum 417, Kopfgebäude TNFTurm

A theoretical introduction into the area of computer algebra, especially the constructive solution of systems of polynomial equations, will be 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.
Lecture mode: 
The course is a combination of lecture and exercises (KV). The exercise
part will be supervised by Dr. Günter Landsmann. 

Each week you can find the exercises for next week's session here.
