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.
Facts
Time Complexity
Time Complexity (category)Polynomial Time -- O(n^k) 1 Sources
1. Wikipedia: Polynomial decomposition
Lead sectionQuote, Lead section
In mathematics, a polynomial decomposition expresses a polynomial f as the functional composition g ∘ h {\displaystyle g\circ h} of polynomials g and h, where g and h have degree greater than 1; it is an algebraic functional decomposition.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.