Pages that link to "Item:Q5903274"
From MaRDI portal
The following pages link to Polynomial decomposition algorithms (Q5903274):
Displayed 16 items.
- A proof of a theorem by Fried and MacRae and applications to the composition of polynomial functions (Q636797) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- Functional decomposition of polynomials: the wild case (Q755793) (← links)
- An algorithm for the decomposition of differential polynomials in the general case (Q763572) (← links)
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem (Q990817) (← links)
- Computational problems in the theory of finite fields (Q1180998) (← links)
- The inverse of an automorphism in polynomial time (Q1190750) (← links)
- A note on separated factors of separated polynomials (Q1373276) (← links)
- Counting invariant subspaces and decompositions of additive polynomials (Q1994893) (← links)
- Normal form for Ritt's second theorem (Q2253092) (← links)
- Compositions and collisions at degree \(p^2\) (Q2437328) (← links)
- On the decomposition of rational functions (Q2481476) (← links)
- Counting decomposable polynomials with integer coefficients (Q2684469) (← links)
- A recombination algorithm for the decomposition of multivariate rational functions (Q2840631) (← links)
- Polynomial decomposition algorithms (Q5893804) (← links)
- Tame decompositions and collisions (Q5925210) (← links)