Decomposition of algebraic functions

DOI10.1006/JSCO.1996.0051zbMATH Open0876.68062OpenAlexW2056148362MaRDI QIDQ674743FDOQ674743

Authors: Dexter Kozen, Susan Landau, Richard Zippel 

Publication date: 11 September 1997

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1996.0051

Recommendations

• scientific article; zbMATH DE number 1273634
• Functional decomposition of polynomials: the tame case
• Functional decomposition of polynomials: the wild case
• Algorithms for the Functional Decomposition of Laurent Polynomials
• A rational function decomposition algorithm by near-separated polynomials

zbMATH Keywords

functional decompositionresultant decomposition

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05)

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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Symbolic additive decomposition of rational functions
• Title not available (Why is that?)
• 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
• Tame decompositions and collisions
• Decomposing tropical rational functions
• 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)