Polynomial decomposition algorithms
From MaRDI portal
Publication:5893804
DOI10.1016/S0747-7171(89)80027-6zbMath0691.68030MaRDI QIDQ5893804
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (25)
Decomposition of ordinary difference polynomials ⋮ Identification of Hammerstein–Wiener models with hysteresis front nonlinearities ⋮ A short proof for the open quadrant problem ⋮ Sparse shifts for univariate polynomials ⋮ Counting decomposable polynomials with integer coefficients ⋮ Counting Decomposable Univariate Polynomials ⋮ Compositions and collisions at degree \(p^2\) ⋮ Algebraic computation of resolvents without extraneous powers ⋮ Computational problems in the theory of finite fields ⋮ 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 ⋮ On the decomposition of rational functions ⋮ 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 ⋮ Algorithms for the Functional Decomposition of Laurent Polynomials ⋮ Functional decomposition of polynomials: the wild case ⋮ Algebraic Condition for Decomposition of Large-Scale Linear Dynamic Systems ⋮ Tame decompositions and collisions ⋮ An algorithm for the decomposition of differential polynomials in the general case ⋮ \(\sqrt{2}+\sqrt{3}\): Four different views ⋮ A recombination algorithm for the decomposition of multivariate rational functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solvability by radicals is in polynomial time
- Prime and composite polynomials
- On the invariance of chains of fields
- Fast Parallel Computation of Polynomials Using Few Processors
- Fast Parallel Matrix Inversion Algorithms
- Fast Algorithms for Manipulating Formal Power Series
- Polynomial Substitutions
- Composite Polynomials with Coefficients in an Arbitrary Field of Characteristic Zero
- Polynomial decomposition algorithms
This page was built for publication: Polynomial decomposition algorithms
