AN O(N1-10.89) PRIMALITY TESTING ALGORITHM

[1] Burgess DA., 1962, P LOND MATH SOC, V3, P179

[2] Burgess DA., 1957, MATHEMATIKA, V4, P106, DOI DOI 10.1112/S0025579300001157

[3] BURGESS DA, 1962, P LOND MATH SOC, V12, P193, DOI DOI 10.1112/PLMS/S3-12.1.193

[4] RIEMANNS HYPOTHESIS AND TESTS FOR PRIMALITY [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 300 - 317

[5] NORTON KK, 1971, 106 AM MATH SOC MEM

[6] THEOREMS ON FACTORIZATION AND PRIMALITY TESTING [J]. PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1974, 76 (NOV): : 521 - 528

[7] Rabin M.O., 1976, ALGORITHMS COMPLEXIT, P21

[8] Solovay R., 1977, SIAM Journal on Computing, V6, P84, DOI 10.1137/0206006

[9] [No title captured]

[1] Burgess DA., 1962, P LOND MATH SOC, V3, P179

[2] Burgess DA., 1957, MATHEMATIKA, V4, P106, DOI DOI 10.1112/S0025579300001157

[3] BURGESS DA, 1962, P LOND MATH SOC, V12, P193, DOI DOI 10.1112/PLMS/S3-12.1.193

[4] RIEMANNS HYPOTHESIS AND TESTS FOR PRIMALITY [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 300 - 317

[5] NORTON KK, 1971, 106 AM MATH SOC MEM

[6] THEOREMS ON FACTORIZATION AND PRIMALITY TESTING [J]. PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1974, 76 (NOV): : 521 - 528

[7] Rabin M.O., 1976, ALGORITHMS COMPLEXIT, P21

[8] Solovay R., 1977, SIAM Journal on Computing, V6, P84, DOI 10.1137/0206006

[9] [No title captured]