Functional decomposition of polynomials: the wild case
From MaRDI portal
Publication:755793
DOI10.1016/S0747-7171(08)80054-5zbMath0722.12003MaRDI QIDQ755793
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
polynomial-time algorithmcomplete decompositionfunctional decompositionexponential-timetame casewild case
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (19)
An application of algebraic geometry to encryption: tame transformation method ⋮ On decomposition of sub-linearised-polynomials ⋮ A family of weak keys in HFE and the corresponding practical key-recovery ⋮ Decomposing tropical rational functions ⋮ Counting decomposable polynomials with integer coefficients ⋮ Counting Decomposable Univariate Polynomials ⋮ Compositions and collisions at degree \(p^2\) ⋮ Computational problems in the theory of finite fields ⋮ Permutation polynomials of the form \(x^r f(x^{(q-1)/d)}\) and their group structure ⋮ On functional decomposition of multivariate polynomials with differentiation and homogenization ⋮ Decomposition of ordinary differential polynomials ⋮ The inverse of an automorphism in polynomial time ⋮ Counting invariant subspaces and decompositions of additive polynomials ⋮ Normal form for Ritt's second theorem ⋮ Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem ⋮ An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography ⋮ Functional decomposition of polynomials: the tame case ⋮ Tame decompositions and collisions ⋮ A recombination algorithm for the decomposition of multivariate rational functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Functional decomposition of polynomials: the tame case
- Fast multiplication of polynomials over fields of characteristic 2
- Prime and composite polynomials
- On curves with separated variables
- Fast multiplication of large numbers
- Parallel Algorithms for Algebraic Problems
- Effective procedures in field theory
- Hensel and Newton Methods in Valuation Rings
- Polynomial decomposition algorithms
- Polynomial decomposition algorithms
This page was built for publication: Functional decomposition of polynomials: the wild case
