Designing and exploiting fast algorithms for univariate polynomial matrices - Lecture 1
By Vincent Neiger
Creative telescoping for D-finite functions - Lecture 1
By Christoph Koutschan
By Aurel Page
Appears in collection : Introduction, Complexity, Arithmetic Operations
This course provides an overview of algorithms useful in computational mathematics, especially in number theory. The perspective is that of a user's point of view, mostly focusing on how to use the algorithms and giving details only about a selection.