Abstract
The composition of two polynomials
g
(
h
) =
g
o
h
is a polynomial. For a given polynomial
f
we are interested in finding a functional decomposition
f
=
g
o
h
. In this paper an algorithm is described, which computes all minimal decompositions in polynomial time. In contrast to many previous decomposition algorithms this algorithm works without restrictions on the degree of the polynomial and the characteristic of the ground field. The algorithm can be iteratively applied to compute all decompositions. It is based on ideas of Landau & Miller (1985) and Zippel (1991). Additionally, an upper bound on the number of minimal decompositions is given.
Publisher
Association for Computing Machinery (ACM)
Reference19 articles.
1. An algorithm for finding the blocks of a permutation group
2. Polynomial decomposition algorithms
3. Raoul Blankertz (2011). Decomposition of Polynomials. Diplomarbeit Universität Bonn Bonn. Modified version available at http://arxiv.org/abs/1107.0687. Raoul Blankertz (2011). Decomposition of Polynomials. Diplomarbeit Universität Bonn Bonn. Modified version available at http://arxiv.org/abs/1107.0687.
4. Compositions and collisions at degreep2
5. Complexity issues in bivariate polynomial factorization
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献