RIEMANNS HYPOTHESIS AND TESTS FOR PRIMALITY

被引：335

作者：

MILLER, GL ^{[1
]}

机构：

[1] UNIV WATERLOO, DEPT COMP SCI, WATERLOO N2L 3G1, ONTARIO, CANADA

来源：

关键词：

D O I：

10.1016/S0022-0000(76)80043-8

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：300 / 317

页数：18

共 15 条

[1] THE LEAST QUADRATIC NON RESIDUE [J].

ANKENY, NC .

[2]

Burgess DA., 1962, P LOND MATH SOC, V3, P179

[3]

Carmichael R. D., 1912, AM MATH MON, V19, P22

[4]

Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[5]

Knuth D. E., 1969, ART COMPUTER PROGRAM, V2

[6] THEOREMS ON FACTORIZATION AND PRIMALITY TESTING [J].

POLLARD, JM .

PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1974, 76 (NOV) :521-528

[7]

Pratt V. R., 1975, SIAM Journal on Computing, V4, P214, DOI 10.1137/0204018

[8] FAST MULTIPLICATION OF LARGE NUMBERS [J].

SCHONHAGE, A ;

STRASSEN, V .

[9]

Shanks Daniel, 1971, 1969 NUMB THEOR I AM, V20, P41

[10]

[No title captured]