Parallel algorithms for algebraic problems
SIAM Journal on Computing
Polynomial decomposition algorithms
Journal of Symbolic Computation
Polynomial decomposition algorithms
Journal of Symbolic Computation
Functional decomposition ofpolynomials: the tame case
Journal of Symbolic Computation - Special issue on computational algebraic complexity
The inverse of an automorphism in polynomial time
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Rational function decomposition
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Homogeneous decomposition of polynomials
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
A practical implementation of two rational function decomposition algorithms
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Fast computations in the lattice of polynomial rational function fields
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Weaknesses in the SL2(IFs2) Hashing Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Computer algebra handbook
Decomposition of ordinary difference polynomials
Journal of Symbolic Computation
High order derivatives and decomposition of multivariate polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
The number of decomposable univariate polynomials. extended abstract
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
Journal of Symbolic Computation
Composition collisions and projective polynomials: statement of results
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Decomposition of generic multivariate polynomials
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
On decomposition of tame polynomials and rational functions
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Lower bounds for decomposable univariate wild polynomials
Journal of Symbolic Computation
Compositions and collisions at degree p 2
Journal of Symbolic Computation
A computer algebra user interface manifesto
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
If g and h are polynomials of degrees r and s over a field, their functional composition f = g(h) has degree n = rs. The functional decomposition problem is: given f of degree n = rs, determine whether such g and h exist, and, in the affirmative case, compute them. An apparently difficult case is when the characteristic p of the ground field divides r. This paper presents a polynomial-time partial solution for this ''wild'' case; it works, e.g., when p^2 @? r.