Factoring polynomials over large finite fields
暂无分享，去创建一个
[1] W. S. Brown,et al. An Irreducibility Criterion for Polynomials Over the Integers , 1969 .
[2] H. Zassenhaus. On Hensel factorization, I , 1969 .
[3] George E. Collins,et al. Computing multiplicative inverses in () , 1969 .
[4] G. E. Collins. Computing Multiplicative Inverses in GF(p) , 1969 .
[5] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[6] E. Berlekamp. Factoring polynomials over finite fields , 1967 .
[7] Elwyn R. Berlekamp,et al. On the Solution of Algebraic Equations over Finite Fields , 1967, Inf. Control..
[8] Daniel B. Lloyd. Factorization of the General Polynomial by Means of Its Homomorphic Congruential Functions , 1964 .
[9] Walter Gautschi,et al. On inverses of Vandermonde and confluent Vandermonde matrices. II , 1963 .
[10] D. A. Burgess. On Character Sums and Primitive Roots , 1962 .
[11] Štefan Schwarz. ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD , 1956 .
[12] On the irreducibility of certain polynomials , 1946 .
[13] Garrett Birkhoff,et al. A survey of modern algebra , 1942 .