摘要:
acm.org
sci-hub.se 参考文章(19)
J. Gutiérrez, T. Recio, C. Ruiz de Velasco, Polynomial decomposition algorithm of almost quadratic complexity Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. pp. 471- 475 ,(1989) , 10.1007/3-540-51083-4_83
Matthew Thomas Dickerson, The functional decomposition of polynomials Cornell University. ,(1989)
Susan Landau, Gary Lee Miller, Solvability by radicals is in polynomial time Journal of Computer and System Sciences. ,vol. 30, pp. 179- 208 ,(1985) , 10.1016/0022-0000(85)90013-3
Erich Kaltofen, Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization SIAM Journal on Computing. ,vol. 14, pp. 469- 489 ,(1985) , 10.1137/0214035
Vangalur S. Alagar, Mai Tanh, Fast Polynominal Decomposition Algorithms european conference on computer algebra. pp. 150- 153 ,(1985)
Dexter Kozen, Susan Landau, Polynomial decomposition algorithms Journal of Symbolic Computation. ,vol. 7, pp. 445- 456 ,(1989) , 10.1016/S0747-7171(89)80027-6
Susan Landau, Factoring Polynomials over Algebraic Number Fields SIAM Journal on Computing. ,vol. 14, pp. 184- 195 ,(1985) , 10.1137/0214015
H. T. Kung, J. F. Traub, All Algebraic Functions Can Be Computed Fast Journal of the ACM. ,vol. 25, pp. 245- 260 ,(1978) , 10.1145/322063.322068
Joachim von zur Gathen, Dexter Kozen, Susan Landau, Functional decomposition of polynomials 28th Annual Symposium on Foundations of Computer Science (sfcs 1987). pp. 127- 131 ,(1987) , 10.1109/SFCS.1987.29
Matthew Dickerson, The inverse of an automorphism in polynomial time Journal of Symbolic Computation. ,vol. 13, pp. 209- 220 ,(1992) , 10.1016/S0747-7171(08)80090-9