Functional decomposition of polynomials: the tame case
From MaRDI portal
(Redirected from Publication:753496)
Recommendations
Cites work
- scientific article; zbMATH DE number 4101330 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3999284 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- Composite Polynomials with Coefficients in an Arbitrary Field of Characteristic Zero
- Effective procedures in field theory
- Factoring Polynomials Over Large Finite Fields
- Fast Algorithms for Manipulating Formal Power Series
- Fast Parallel Computation of Polynomials Using Few Processors
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast computation of GCDs
- Fast multiplication of polynomials over fields of characteristic 2
- Functional decomposition of polynomials: the wild case
- Greatest common divisors of polynomials given by straight-line programs
- Irreducibility of multivariate polynomials
- On curves with separated variables
- On fast multiplication of polynomials over arbitrary algebras
- On the invariance of chains of fields
- Parallel Algorithms for Algebraic Problems
- Polynomial Substitutions
- Polynomial decomposition algorithms
- Polynomial decomposition algorithms
- Prime and composite polynomials
- Very Fast Parallel Polynomial Arithmetic
Cited in
(44)- Polynomial decompositions in polynomial time
- Triangulable locally nilpotent derivations in dimension three
- Tame decompositions and collisions
- Compositions and collisions at degree \(p^2\)
- An application of algebraic geometry to encryption: tame transformation method
- Decomposition of ordinary differential polynomials
- Hyperelliptic Curves with Extra Involutions
- Algorithms for the Functional Decomposition of Laurent Polynomials
- Interpolation by decomposable univariate polynomials
- New algorithms for exact and approximate polynomial decomposition
- Counting decomposable polynomials with integer coefficients
- Counting decomposable multivariate polynomials
- Counting invariant subspaces and decompositions of additive polynomials
- The inverse of an automorphism in polynomial time
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
- A family of weak keys in HFE and the corresponding practical key-recovery
- Decomposition of algebraic functions
- Normal form for Ritt's second theorem
- Algebraic computation of resolvents without extraneous powers
- Efficient decomposition of separable algebras.
- A recombination algorithm for the decomposition of multivariate rational functions
- Fast Hermite interpolation and evaluation over finite fields of characteristic two
- On decomposition of sub-linearised-polynomials
- Counting decomposable univariate polynomials
- Polynomial decomposition algorithms
- scientific article; zbMATH DE number 4154575 (Why is no real title available?)
- Functional decomposition of polynomials: the wild case
- Decomposition of polynomials and approximate roots
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
- Polynomial decomposition algorithms
- General polynomial decomposition and the s-1-decomposition are NP-Hard
- Indecomposability of polynomials via Jacobian matrix
- A polynomial time algorithm for computing all minimal decompositions of a polynomial
- Modular composition modulo triangular sets and applications
- Computational problems in the theory of finite fields
- On functional decomposition of multivariate polynomials with differentiation and homogenization
- On Decomposition of Tame Polynomials and Rational Functions
- Propensity score model specification for estimation of average treatment effects
- Fixed elements of noninjective endomorphisms of polynomial algebras in two variables
- A note on separated factors of separated polynomials
- Decomposition of generic multivariate polynomials
- Algebraic Condition for Decomposition of Large-Scale Linear Dynamic Systems
- Decomposition of ordinary difference polynomials
- Fast systematic encoding of multiplicity codes
This page was built for publication: Functional decomposition of polynomials: the tame case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753496)
