A polynomial decomposition algorithm
David R. Barton, Richard E. Zippel · 1976
This paper presents an efficient, effective algorithm for decomposing a polynomial f(x) into an irreducible representation of the form f(x) = g1(g2( ... gn(x) ... )). This decomposition is used as an aid in solving high degree metacyclic equations in radicals and preconditioning polynomials for evaluation.