Syllabus.pdf

Time exercises:	Tue 15:30 - 16:15
Time lecture:	Tue 16:30 - 18:00
Place:	HS 13
First Lecture:	October 4

Lecture: A theoretical and practical introduction into the area of computer algebra will be presented. In particular we deal with the constructive symbolic solution of systems of algebraic (i.e. polynomial) equations, and factorization of polynomials.

The course will follow the appropriate chapters in:

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

Lecture notes:	0-title.pdf
	1-what-is-ca.pdf
	2-1-Groebner-Intro.pdf
	2-2-Groebner-Rob.pdf
	2-3-Groebner-Theory.pdf
	2-4-Groebner-Application.pdf
	3-poly-gcd.pdf
	4-resultants.pdf
	5-factorization.pdf
	6-app-arith.pdf

Final Exam / Klausur	on 27 January 2017, 15:30--17:00, HS 18
	no books / ohne Unterlagen.
	Exam questions: Klausur.pdf
	Ergebnisse.pdf

Execises: The exercise part consists of homework exercises and a project.

Exercise sheets:
	for 11.10.2016		ue1.pdf
	for 18.10.2016		ue2.pdf
	for 25.10.2016		ue3.pdf
	for 08.11.2016		ue4.pdf
	for 15.11.2016		ue5.pdf
	for 22.11.2016		ue6.pdf
	for 29.11.2016		ue7.pdf
	for 13.12.2016		ue8.pdf
	for 10.01.2017		ue9.pdf
	for 17.01.2017		ue10.pdf

Project abstracts: CA-projects.pdf

Webpage: www.risc.jku.at/education/courses/ws2016/ca