Functional decomposition ofpolynomials: the tame case
- 31 March 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 9 (3) , 281-299
- https://doi.org/10.1016/s0747-7171(08)80014-4
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Greatest common divisors of polynomials given by straight-line programsJournal of the ACM, 1988
- Irreducibility of multivariate polynomialsJournal of Computer and System Sciences, 1985
- Polynomial decomposition algorithmsJournal of Symbolic Computation, 1985
- Fast Algorithms for Manipulating Formal Power SeriesJournal of the ACM, 1978
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- On curves with separated variablesMathematische Annalen, 1969
- Effective procedures in field theoryPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1956
- Composite Polynomials with Coefficients in an Arbitrary Field of Characteristic ZeroAmerican Journal of Mathematics, 1942
- Polynomial SubstitutionsAmerican Journal of Mathematics, 1941
- Prime and composite polynomialsTransactions of the American Mathematical Society, 1922