Functional decomposition of polynomials: the wild case
From MaRDI portal
Recommendations
Cites work
- Effective procedures in field theory
- Fast multiplication of large numbers
- Fast multiplication of polynomials over fields of characteristic 2
- Functional decomposition of polynomials: the tame case
- Hensel and Newton Methods in Valuation Rings
- scientific article; zbMATH DE number 4101330 (Why is no real title available?)
- scientific article; zbMATH DE number 3657898 (Why is no real title available?)
- scientific article; zbMATH DE number 3804835 (Why is no real title available?)
- On curves with separated variables
- Parallel Algorithms for Algebraic Problems
- Polynomial decomposition algorithms
- Polynomial decomposition algorithms
- Prime and composite polynomials
Cited in
(32)- Computational problems in the theory of finite fields
- Permutation polynomials of the form \(x^r f(x^{(q-1)/d)}\) and their group structure
- The inverse of an automorphism in polynomial time
- Factoring in skew-polynomial rings over finite fields
- On polynomial decompositions
- An application of algebraic geometry to encryption: tame transformation method
- Lower bounds for decomposable univariate wild polynomials
- Counting invariant subspaces and decompositions of additive polynomials
- Decomposing tropical rational functions
- Normal form for Ritt's second theorem
- Compositions and collisions at degree \(p^2\)
- Counting decomposable polynomials with integer coefficients
- A recombination algorithm for the decomposition of multivariate rational functions
- Polynomial decompositions in polynomial time
- A family of weak keys in HFE and the corresponding practical key-recovery
- On Decomposition of Tame Polynomials and Rational Functions
- scientific article; zbMATH DE number 1279024 (Why is no real title available?)
- General polynomial decomposition and the s-1-decomposition are NP-Hard
- On decomposition of sub-linearised-polynomials
- On functional decomposition of multivariate polynomials with differentiation and homogenization
- Functional decomposition using principal subfields
- A polynomial time algorithm for computing all minimal decompositions of a polynomial
- Counting decomposable univariate polynomials
- Polynomial decomposition algorithms
- Polynomial decomposition algorithms
- Tame decompositions and collisions
- Decomposition of algebraic functions
- An approximate decomposition of a multivariate polynomial and its application
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
- Functional decomposition of polynomials: the tame case
- Decomposition of ordinary differential polynomials
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
This page was built for publication: Functional decomposition of polynomials: the wild case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q755793)
