Speaker
Daniel Taufer
(KU Leuven)
Description
In this talk and the next one we will revise the algorithm for polynomial
decomposition originally proposed by Brachat-Comon-Mourrain-Tsidgaridas and
we will show how we can improve it. Then we will see how certain
modifications to the algorithm can lead to a cactus decomposition.