Master-Thesis
Decomposition of polynomials
One is interested in functional decomposition f = g(h) of polynomials. First an algorithms is described, which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). An upper bound for the number of minimal decompositions is derived. Finally a proof of a conjecture in von zur Gathen et al. (2010) is given, which states a normal form for a special class of decomposable polynomials.