Mark Giesbrecht

We consider the algorithmic problem of the functional decomposition of sparse polynomials. For example, (very) given a very high degree (5∗2 100)(5∗2 100) and very sparse (7 terms) polynomial like f(x)=x(5∗2 100)+15∗x(2 102+2 47)+90∗x(2 101+2 100+2...

A video of this event is available on mathtube.org Modern symbolic computation systems provide an expressive language for describing mathematical objects. For example, we can easily enter equations such asf=x^{2^{100}}y^2 + 2x^{2^{99}+1}y^{2^{99}+1}...