Functional decomposition of polynomials: the tame case
From MaRDI portal
Publication:753496
DOI10.1016/S0747-7171(08)80014-4zbMATH Open0716.68053MaRDI QIDQ753496FDOQ753496
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Recommendations
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05)
Cites Work
- On fast multiplication of polynomials over arbitrary algebras
- Fast multiplication of polynomials over fields of characteristic 2
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast Algorithms for Manipulating Formal Power Series
- Title not available (Why is that?)
- Factoring Polynomials Over Large Finite Fields
- Fast Parallel Computation of Polynomials Using Few Processors
- Effective procedures in field theory
- Polynomial decomposition algorithms
- Irreducibility of multivariate polynomials
- Parallel Algorithms for Algebraic Problems
- Greatest common divisors of polynomials given by straight-line programs
- Very Fast Parallel Polynomial Arithmetic
- Fast computation of GCDs
- On the invariance of chains of fields
- Polynomial Substitutions
- Title not available (Why is that?)
- Functional decomposition of polynomials: the wild case
- Title not available (Why is that?)
- Prime and composite polynomials
- Composite Polynomials with Coefficients in an Arbitrary Field of Characteristic Zero
- On curves with separated variables
- Polynomial decomposition algorithms
- Title not available (Why is that?)
Cited In (40)
- Hyperelliptic Curves with Extra Involutions
- On decomposition of sub-linearised-polynomials
- Propensity score model specification for estimation of average treatment effects
- Counting invariant subspaces and decompositions of additive polynomials
- Fast Hermite interpolation and evaluation over finite fields of characteristic two
- General polynomial decomposition and the s-1-decomposition are NP-Hard
- Decomposition of ordinary difference polynomials
- Modular composition modulo triangular sets and applications
- Indecomposability of polynomials via Jacobian matrix
- Counting decomposable multivariate polynomials
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
- Computational problems in the theory of finite fields
- Decomposition of ordinary differential polynomials
- Algebraic computation of resolvents without extraneous powers
- New algorithms for exact and approximate polynomial decomposition
- Normal form for Ritt's second theorem
- A recombination algorithm for the decomposition of multivariate rational functions
- On Decomposition of Tame Polynomials and Rational Functions
- Interpolation by decomposable univariate polynomials
- Compositions and collisions at degree \(p^2\)
- Algebraic Condition for Decomposition of Large-Scale Linear Dynamic Systems
- FIXED ELEMENTS OF NONINJECTIVE ENDOMORPHISMS OF POLYNOMIAL ALGEBRAS IN TWO VARIABLES
- Polynomial decomposition algorithms
- Efficient decomposition of separable algebras.
- On functional decomposition of multivariate polynomials with differentiation and homogenization
- Polynomial decomposition algorithms
- Counting Decomposable Univariate Polynomials
- Decomposition of polynomials and approximate roots
- Functional decomposition of polynomials: the wild case
- The inverse of an automorphism in polynomial time
- Counting decomposable polynomials with integer coefficients
- A family of weak keys in HFE and the corresponding practical key-recovery
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
- Tame decompositions and collisions
- Triangulable locally nilpotent derivations in dimension three
- Title not available (Why is that?)
- A note on separated factors of separated polynomials
- An application of algebraic geometry to encryption: tame transformation method
- Algorithms for the Functional Decomposition of Laurent 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)
