| Detailed information |
| Original study plan |
Master's programme Computational Mathematics 2023W |
| Objectives |
Develop an understanding of techniques for constructing efficient algorithms for polynomial arithmetic and factorization.
|
| Subject |
Subquadratic algorithms for multiplication, evaluation/interpolation, gcd.
Lattice reduction.
Classical algorithms for polynomial factorization over various ground fields.
|
| Criteria for evaluation |
Exam
|
| Methods |
blackboard presentation
|
| Language |
English |
| Study material |
Joachim von zur Gathen and Juergen Gerhard. Modern Computer Algebra.
|
| Changing subject? |
No |
| Further information |
Assumes the audience to be familiar with the material taught in the course "Computer Algebra".
|
| Earlier variants |
They also cover the requirements of the curriculum (from - to)
404ANDMCA2V20: VL Computer Algebra II (2020W-2023S)
|
