Polynomial decomposition algorithms

DOI10.1016/S0747-7171(85)80012-2zbMath0605.12012OpenAlexW2087154100MaRDI QIDQ5903274

David R. Barton, Richard Zippel

Publication date: 1985

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(85)80012-2

zbMATH Keywords

polynomial decomposition algorithms

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items (16)

A note on separated factors of separated polynomials ⋮ Counting decomposable polynomials with integer coefficients ⋮ A proof of a theorem by Fried and MacRae and applications to the composition of polynomial functions ⋮ Compositions and collisions at degree \(p^2\) ⋮ Polynomial decomposition algorithms ⋮ Computational problems in the theory of finite fields ⋮ The inverse of an automorphism in polynomial time ⋮ Counting invariant subspaces and decompositions of additive polynomials ⋮ Normal form for Ritt's second theorem ⋮ On the decomposition of rational functions ⋮ Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem ⋮ Functional decomposition of polynomials: the tame case ⋮ Functional decomposition of polynomials: the wild case ⋮ Tame decompositions and collisions ⋮ An algorithm for the decomposition of differential polynomials in the general case ⋮ A recombination algorithm for the decomposition of multivariate rational functions

Cites Work

• Unnamed Item
• Unnamed Item
• Prime and composite polynomials
• On the invariance of chains of fields
• On curves with separated variables
• Arithmetical properties of function fields (II). The generalized Schur problem
• Polynomial Substitutions
• Composite Polynomials with Coefficients in an Arbitrary Field of Characteristic Zero

This page was built for publication: Polynomial decomposition algorithms