Powering Sparse Polynomials
Roman Pearce, CECM, Simon Fraser University
The problem of expanding powers of polynomials seems to have received little attention since the 1970's. In this talk we present the best known algorithms, recently reimplemented in C for Maple 15, and consider whether there might be room for some improvement. This is joint work with Michael Monagan.