Functional decomposition of polynomials: The wild case
- 30 November 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 10 (5) , 437-452
- https://doi.org/10.1016/s0747-7171(08)80054-5
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Functional decomposition ofpolynomials: the tame caseJournal of Symbolic Computation, 1990
- Polynomial decomposition algorithmsJournal of Symbolic Computation, 1989
- Polynomial decomposition algorithm of almost quadratic complexityLecture Notes in Computer Science, 1989
- Polynomial decomposition algorithmsJournal of Symbolic Computation, 1985
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- Hensel and Newton methods in valuation ringsMathematics of Computation, 1984
- Schnelle Multiplikation von Polynomen ber K rpern der Charakteristik 2Acta Informatica, 1977
- Prime and composite polynomialsJournal of Algebra, 1974
- On curves with separated variablesMathematische Annalen, 1969
- Prime and composite polynomialsTransactions of the American Mathematical Society, 1922