Computer Algebra II: Fast arithmetic and Factorization (Lecture)

Summer 2012

Description - Course Details


How many field operations are needed to multiply two univariate polynomials of degree n over some field K? How about the number of field operations needed for factoring a polynomial or computing a greatest common divisor of two polynomials? Efficient algorithms for these and other problems were presented in Computer Algebra I, but are they as efficient as can be? It turns out that they are not. In Computer Algebra II we will present faster algorithms, including some of the fastest algorithms known today for solving algebraic problems.

Course Details


Computing in homomorphic images (2012-04-18)