(*)- 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.
|
