Rational function decomposition
- 1 June 1991
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
This paper presents a polynomial time algorithm for determining whether a given univariate rational function over an arbitrary field is the composition of two rational functions over that field, and finds them if so.Keywords
This publication has 15 references indexed in Scilit:
- Functional decomposition of polynomials: The wild caseJournal of Symbolic Computation, 1990
- Functional decomposition ofpolynomials: the tame caseJournal of Symbolic Computation, 1990
- Polynomial decomposition algorithmsJournal of Symbolic Computation, 1989
- Polynomial decomposition algorithmsJournal of Symbolic Computation, 1985
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial FactorizationSIAM Journal on Computing, 1985
- Solvability by radicals is in polynomial timeJournal of Computer and System Sciences, 1985
- A Property of Euclid’s Algorithm and an Application to Padé ApproximationSIAM Journal on Applied Mathematics, 1978
- All Algebraic Functions Can Be Computed FastJournal of the ACM, 1978
- Prime and composite polynomialsJournal of Algebra, 1974
- Algebraische Theorie der Körper.Journal für die reine und angewandte Mathematik (Crelles Journal), 1910