Polynomial decomposition algorithms
- 31 May 1989
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 7 (5) , 445-456
- https://doi.org/10.1016/s0747-7171(89)80027-6
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Polynomial decomposition algorithmsJournal of Symbolic Computation, 1985
- Solvability by radicals is in polynomial timeJournal of Computer and System Sciences, 1985
- Fast Algorithms for Manipulating Formal Power SeriesJournal of the ACM, 1978
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- Prime and composite polynomialsJournal of Algebra, 1974
- On the invariance of chains of fieldsIllinois Journal of Mathematics, 1969
- 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
- Asymptotic Formulaae in Combinatory AnalysisProceedings of the London Mathematical Society, 1918