Functional decomposition of polynomials: the tame case

DOI10.1016/S0747-7171(08)80014-4zbMath0716.68053MaRDI QIDQ753496

Joachim von zur Gathen

Publication date: 1990

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items (30)

An application of algebraic geometry to encryption: tame transformation method ⋮ Decomposition of ordinary difference polynomials ⋮ On decomposition of sub-linearised-polynomials ⋮ Modular composition modulo triangular sets and applications ⋮ A family of weak keys in HFE and the corresponding practical key-recovery ⋮ Fast systematic encoding of multiplicity codes ⋮ Counting decomposable polynomials with integer coefficients ⋮ Counting Decomposable Univariate Polynomials ⋮ Counting decomposable multivariate polynomials ⋮ Compositions and collisions at degree \(p^2\) ⋮ Algebraic computation of resolvents without extraneous powers ⋮ FIXED ELEMENTS OF NONINJECTIVE ENDOMORPHISMS OF POLYNOMIAL ALGEBRAS IN TWO VARIABLES ⋮ Triangulable locally nilpotent derivations in dimension three ⋮ Hyperelliptic Curves with Extra Involutions ⋮ Computational problems in the theory of finite fields ⋮ On functional decomposition of multivariate polynomials with differentiation and homogenization ⋮ Decomposition of ordinary differential polynomials ⋮ The inverse of an automorphism in polynomial time ⋮ Decomposition of polynomials and approximate roots ⋮ Counting invariant subspaces and decompositions of additive polynomials ⋮ Normal form for Ritt's second theorem ⋮ Propensity score model specification for estimation of average treatment effects ⋮ Indecomposability of polynomials via Jacobian matrix ⋮ Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem ⋮ Fast Hermite interpolation and evaluation over finite fields of characteristic two ⋮ An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography ⋮ Functional decomposition of polynomials: the wild case ⋮ Algebraic Condition for Decomposition of Large-Scale Linear Dynamic Systems ⋮ Tame decompositions and collisions ⋮ A recombination algorithm for the decomposition of multivariate rational functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional decomposition of polynomials: the wild case
• Irreducibility of multivariate polynomials
• On fast multiplication of polynomials over arbitrary algebras
• Fast multiplication of polynomials over fields of characteristic 2
• Prime and composite polynomials
• On the invariance of chains of fields
• On curves with separated variables
• Fast Parallel Computation of Polynomials Using Few Processors
• Parallel Algorithms for Algebraic Problems
• Effective procedures in field theory
• Very Fast Parallel Polynomial Arithmetic
• Greatest common divisors of polynomials given by straight-line programs
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fast computation of GCDs
• Fast Algorithms for Manipulating Formal Power Series
• Factoring Polynomials Over Large Finite Fields
• Polynomial Substitutions
• Composite Polynomials with Coefficients in an Arbitrary Field of Characteristic Zero
• Polynomial decomposition algorithms
• Polynomial decomposition algorithms

This page was built for publication: Functional decomposition of polynomials: the tame case