2011/07/04 by Raoul Blankertz, Blankertz, Raoul
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Coding theory and cryptography #Commutative Algebra (math.AC) #FOS: Computer and information sciences #FOS: Mathematics #Symbolic Computation (cs.SC) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1107.0687
openalex publication_date 2011/07/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This diploma thesis is concerned with functional decomposition f = g ∘ 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.