Computer Algebra II (Lecture)
How many field operations are needed to multiply two univariate polynomials
of degree n over some field K?
How about the number of field operations needed for factoring a polynomial
or computing a greatest common divisor of two polynomials?
Efficient algorithms for these and other problems were presented in
Computer Algebra I, but are they as efficient as can be?
It turns out that they are not. In Computer Algebra II we will present
faster algorithms, including some of the fastest algorithms known today
for solving algebraic problems.
- Lecturer: Manuel Kauers
- If you are regular JKU student, please register to this course via
- Exam/credits mode: will be discussed in the first meeting
- Wednesdays, 9.00--10.30, Seminar room Hagenberg, and
- Thursdays, 10.15--11.45, K034D, (Exception for May 29: 8.30--10.00, T111)
- First meeting: Wednesday, May 7
- Prerequisits: Students are expected to be familiar with the material of
Computer Algebra I
- Literature: Modern Computer Algebra by von zur Gathen and Gerhard,
Algorithms for Computer Algebra by Geddes, Czapor, and Labahn, Kluwer 1992.