Polynomial Decomposition

A polynomial decomposition expresses a polynomial f as the functional composition of two polynomials g and h, each of degree greater than one, making it an algebraic functional decomposition. Algorithms exist for decomposing univariate polynomials in polynomial time, and the theory distinguishes composite polynomials, which can be decomposed this way, from indecomposable or prime polynomials, which cannot. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/