Menü
Positionsanzeige
Inhalt

[ 404CANCACAV23 ] VL Advanced Computer Algebra
Versionsauswahl
Workload Education level Study areas Responsible person Hours per week Coordinating university
3 ECTS M - Master's programme Mathematics Manuel Kauers 2 hpw Johannes Kepler University Linz
Detailed information
Original study plan Master's programme Computational Mathematics 2025W
Learning Outcomes
Competences
Develop an understanding of techniques for constructing efficient algorithms for polynomial arithmetic and factorization.
Skills Knowledge
  • Analyze the complexity of algebraic algorithms;
  • Develop fast algebraic algorithms based on subquadratic arithmetic;
  • Solve arithmetic problems using lattice reduction;
  • Judge the practical limitations of theoretical complexity estimates;
  • Understand the algebraic underpinnings of polynomial factorization
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)
On-site course
Maximum number of participants -
Assignment procedure Direct assignment