FAST COMPACT PRIME NUMBER SIEVES (AMONG OTHERS)

被引：23

作者：

PRITCHARD, P ^{[1
]}

机构：

[1] CORNELL UNIV,DEPT COMP SCI,ITHACA,NY 14853

来源：

关键词：

D O I：

10.1016/0196-6774(83)90014-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：332 / 344

页数：13

共 19 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Bays C., 1977, BIT (Nordisk Tidskrift for Informationsbehandling), V17, P121, DOI 10.1007/BF01932283

[3]

BRENT RP, 1973, MATH COMPUT, V27, P959, DOI 10.1090/S0025-5718-1973-0330021-0

[4]

DIJKSTRA EW, 1975, COMMUN ACM, V18, P453, DOI [10.1145/360933.360975, 10.1145/390016.808417]

[5]

DIJKSTRA EW, 1972, STRUCTURED PROGRAMMI

[6] LINEAR SIEVE ALGORITHM FOR FINDING PRIME NUMBERS [J].

GRIES, D ;

MISRA, J .

[7] DIFFERENCE BETWEEN CONSECUTIVE PRIMES [J].

HEATHBROWN, DR ;

IWANIEC, H .

[8]

Iwaniec H., 1978, DEMONSTRATIO MATH, V11, P225

[9]

Jensen K., 1974, PASCAL USER MANUAL R

[10]

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