**
**

Asymptotically Fast Methods for Exact Computations

**
University of Western Ontario
Computer Science Department
**

**Date:** September 7, 2009

*
*

*
*

**
Asymptotically fast methods for exact computations
have been known for a quarter of a century.
Unfortunately their impact on computer algebra systems
has been reduced since it was believed that they were
irrelevant in practice.
In this course we show that careful programing
and accurate experimentation can lead to a
successful implementation of these methods
permitting to overcome the
size of magnitude of effective computations.
**

**Comparing to the other Advanced Computer Algebra AM583, this course focusses complexity results and practical efficiency whereas the main concerns of CS874
are theoretical and algorithmic aspects.
**

**Lectures.**- Based on
`the`and recent papers, the course presented efficient methods for computing polynomial gcd and resultants.*Modern Computer Algebra*book **Ressources.**- These are links to the book and software used for the course.

*
*