论文信息 - Primality testing algorithms [after Adleman, Rumely and Williams] - 字舞流文

Primality testing algorithms [after Adleman, Rumely and Williams]

Hendrik W. Lenstra | H. Lenstra

[1] Claus-Peter Schnorr,et al. Refined Analysis and Improvements on Some Factoring Algorithms , 1981, ICALP.

[2] Leonard M. Adleman,et al. On distinguishing prime numbers from composite numbers , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[3] Leonard M. Adleman. On Distinguishing Prime Numbers from Composite Numbers (Abstract) , 1980, FOCS 1980.

[4] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[5] H. Lenstra. Euclid's Algorithm in Cyclotomic Fields , 1975 .

[6] J. M. Pollard,et al. Theorems on factorization and primality testing , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.

[7] F. DeMeyer,et al. Separable algebras over commutative rings , 1971 .

[8] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[9] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[10] K. Prachar. Über die Anzahl der Teiler einer natürlichen Zahl, welche die Formp−1 haben , 1955 .