Recommendations
Cited in
(27)- Counting decomposable univariate polynomials
- General polynomial decomposition and the s-1-decomposition are NP-Hard
- On multivariate rational function decomposition
- On the decomposition of rational functions
- Dynamical systems of correspondences on the projective line I: Moduli spaces and multiplier maps
- Algebraic decomposition of discrete functions
- Decomposition of generic multivariate polynomials
- scientific article; zbMATH DE number 2125603 (Why is no real title available?)
- A recombination algorithm for the decomposition of multivariate rational functions
- On Decomposition of Tame Polynomials and Rational Functions
- Rational function decomposition of polynomials
- On Computing Algebraic Functions Using Logarithms and Exponentials
- Algorithms for the universal decomposition algebra
- scientific article; zbMATH DE number 799767 (Why is no real title available?)
- Symbolic additive decomposition of rational functions
- scientific article; zbMATH DE number 1574483 (Why is no real title available?)
- Algebraic Condition for Decomposition of Large-Scale Linear Dynamic Systems
- Unirational fields of transcendence degree one and functional decomposition
- A polynomial time algorithm for computing all minimal decompositions of a polynomial
- Functional decomposition using principal subfields
- Functional decomposition of polynomials: the wild case
- Decomposition and factorisation of transients in functional graphs
- Decomposing tropical rational functions
- Tame decompositions and collisions
- The decidability of functional decomposition problem
- Algorithms for the Functional Decomposition of Laurent Polynomials
- Functional decomposition of polynomials: the tame case
This page was built for publication: Decomposition of algebraic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674743)
