ON THE DISTRIBUTION OF RUNNING TIMES OF CERTAIN INTEGER FACTORING ALGORITHMS

被引：6

作者：

HAFNER, JL

MCCURLEY, KS

机构：

[1] IBM CORP,DIV RES,ALMADEN RES CTR,SAN JOSE,CA 95120

[2] UNIV SO CALIF,DEPT MATH,LOS ANGELES,CA 90089

来源：

关键词：

D O I：

10.1016/0196-6774(89)90004-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：531 / 556

页数：26

共 29 条

[1]

ADLEMAN L, 1987, DISCRETE ALGORITHMS, P237

[2] ON DISTINGUISHING PRIME-NUMBERS FROM COMPOSITE NUMBERS [J].

ADLEMAN, LM ;

POMERANCE, C ;

RUMELY, RS .

[3]

Ayoub R., 1963, INTRO ANAL THEORY NU

[4]

Brent R.P., 1986, AUSTRAL COMPUT SCI C, V8, P149

[5]

BRILLHART J, 1983, FACTORIZATIONS BN 1

[6]

CHUDNOVSKY DV, 1985, IBM RC11262 IBM TJ W

[7]

COHEN H, 1984, MATH COMPUT, V42, P297, DOI 10.1090/S0025-5718-1984-0726006-X

[8]

COHEN H, 1987, MATH COMPUT, V48, P103, DOI 10.1090/S0025-5718-1987-0866102-2

[9]

de Bruijn N. G., 1951, NEDERL AKAD WETENS A, V54, P50

[10]

Dickman K., 1930, ARK MAT ASTRON FYS, V22A, P1