A SUBLINEAR ADDITIVE SIEVE FOR FINDING PRIME-NUMBERS

被引：36
作者：
PRITCHARD, P
机构：
来源：
COMMUNICATIONS OF THE ACM | 1981年 / 24卷 / 01期
关键词：
D O I：
10.1145/358527.358540
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：18 / 23
页数：6
相关论文
共 10 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]  
BRENT RP, 1973, MATH COMPUT, V27, P959, DOI 10.1090/S0025-5718-1973-0330021-0
[3]  
DIJKSTRA EW, 1975, COMMUN ACM, V18, P453, DOI [10.1145/360933.360975, 10.1145/390016.808417]
[4]  
GALE R, 1977, CGOL ALGEBRAIC NOTAT
[5]   LINEAR SIEVE ALGORITHM FOR FINDING PRIME NUMBERS [J].
GRIES, D ;
MISRA, J .
COMMUNICATIONS OF THE ACM, 1978, 21 (12) :999-1003
[6]   DIFFERENCE BETWEEN CONSECUTIVE PRIMES [J].
HEATHBROWN, DR ;
IWANIEC, H .
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1979, 1 (05) :758-760
[7]   SOME NEW UPPER BOUNDS ON GENERATION OF PRIME NUMBERS [J].
MAIRSON, HG .
COMMUNICATIONS OF THE ACM, 1977, 20 (09) :664-669
[8]  
MISRA J, 1979, EXERCISE PROGRAM EXP
[9]  
PRITCHARD P, 1979, 8 U QUEENSL DEP COMP
[10]  
Wright E., 1979, INTRO THEORY NUMBERS
1