Menü
Positionsanzeige
Inhalt

[ 201ADMAACAU23 ] UE Advanced Computer Algebra
Versionsauswahl
Workload Education level Study areas Responsible person Hours per week Coordinating university
1,5 ECTS M1 - Master's programme 1. year Mathematics Manuel Kauers 1 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Technical 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 Amount and quality of the solutions to the exercises.
Methods Solutions proposed by the students will be discussed in class.
Language English and French
Changing subject? No
Earlier variants They also cover the requirements of the curriculum (from - to)
201ADMACA2U20: UE Computer Algebra II (2020W-2023S)
On-site course
Maximum number of participants 25
Assignment procedure Direct assignment