# Reading Course in Computer Algebra course, Summer 2005

### Problem list

- The Fast Fourier Transform and fast integer multiplication.
- The modular GCD algorithm for multivariate polynomials.
- Modular GCD algorithms in GF(
*p*)[t][x] when*p*is small. - Ratinal number reconstruction.
- Berlekamp's algorithms for factorization in
**Z***p*[x]

The following Maple (.pdf) file contains the problems for the course.

Problems (.pdf)