| Detailinformationen |
| Quellcurriculum |
Masterstudium Computational Mathematics 2023W |
| Ziele |
(*)Develop an understanding of techniques for constructing efficient algorithms for polynomial arithmetic and factorization.
|
| Lehrinhalte |
(*)Subquadratic algorithms for multiplication, evaluation/interpolation, gcd.
Lattice reduction.
Classical algorithms for polynomial factorization over various ground fields.
|
| Beurteilungskriterien |
(*)Exam
|
| Lehrmethoden |
(*)blackboard presentation
|
| Abhaltungssprache |
Englisch |
| Literatur |
(*)Joachim von zur Gathen and Juergen Gerhard. Modern Computer Algebra.
|
| Lehrinhalte wechselnd? |
Nein |
| Sonstige Informationen |
(*)Assumes the audience to be familiar with the material taught in the course "Computer Algebra".
|
| Frühere Varianten |
Decken ebenfalls die Anforderungen des Curriculums ab (von - bis)
404ANDMCA2V20: VL Computer Algebra II (2020W-2023S)
|
