A New Polynomial Factorization Algorithm and its Implementation
暂无分享,去创建一个
[1] P. L. Montgomery,et al. An FFT extension of the elliptic curve method of factorization , 1992 .
[2] H. T. Kung,et al. Fast Algorithms for Manipulating Formal Power Series , 1978, JACM.
[3] David G. Kirkpatrick,et al. Addition Requirements for Matrix and Transposed Matrix Products , 1988, J. Algorithms.
[4] Markus Maurer,et al. Counting the number of points on elliptic curves over finite fields of characteristic greater than three , 1994, ANTS.
[5] Victor Shoup,et al. Fast construction of irreducible polynomials over finite fields , 1994, SODA '93.
[6] Erich Kaltofen,et al. Factoring high-degree polynomials by the black box Berlekamp algorithm , 1994, ISSAC '94.
[7] David Y. Y. Yun,et al. On square-free decomposition algorithms , 1976, SYMSAC '76.
[8] Michael B. Monagan. von zur Gathen's factorization challenge , 1993, SIGS.
[9] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[10] Erich Kaltofen,et al. Subquadratic-time factoring of polynomials over finite fields , 1995, STOC '95.
[11] Joachim von zur Gathen,et al. Computing Frobenius maps and factoring polynomials , 2005, computational complexity.
[12] D. Cantor,et al. A new algorithm for factoring polynomials over finite fields , 1981 .
[13] Joachim von zur Gathen. A polynomial factorization challenge , 1992, SIGS.
[14] Jean Louis Dornstetter. On the equivalence between Berlekamp's and Euclid's algorithms , 1987, IEEE Trans. Inf. Theory.