arXiv · 1107.0687
Decomposition of Polynomials
Abstract
This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A bound for the number of minimal collisions is derived. Finally a proof of a conjecture in von zur Gathen, Giesbrecht & Ziegler (2010) is given, which states a classification for a special class of decomposable polynomials.
Explore related subjects
Keep this discovery
Raoul Blankertz. 2011-07-04. Decomposition of Polynomials. https://arxiv.org/abs/1107.0687
Cite the original work for its findings. Save a collection to share your selection of sources.