GRADES:		grades.pdf
EXAMINATION QUESTIONS:		klausur.pdf

Einsichtnahme Mittwoch 28.2.2007, 8:30 - 10:00 im Raum 416, Kopfgebäude TNF-Turm,
gegen Voranmeldung: <Franz.Winkler@jku.at>


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,
	+	Springer-Verlag Wien New York, 1996 (ISBN 3-211-82759-5)

Participants are expected to be acquainted with the basic notions in algebra and algorithm theory.

Introductory notes:
ps-file: ca-intro.ps pdf-file: ca-intro.pdf

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.

Exercises

for	10.10.2006		ue1.ps	ue1.pdf
for	17.10.2006		ue2.ps	ue2.pdf
for	24.10.2006		ue3.ps	ue3.pdf
for	31.10.2006		ue4.ps	ue4.pdf
for	7.11.2006		ue5.ps	ue5.pdf
for	21.11.2006		ue6.ps	ue6.pdf
for	28.11.2006		ue7.ps	ue7.pdf
for	5.12.2006		ue8.ps	ue8.pdf
for	12.12.2006		ue9.ps	ue9.pdf
for	9.1.2007		ue10.ps	ue10.pdf
for	16.1.2006		ue11.ps	ue11.pdf
for	23.1.2006		ue12.ps	ue12.pdf

---