GENERATING QUASI-RANDOM SEQUENCES FROM SEMI-RANDOM SOURCES

被引：161

作者：

SANTHA, M

VAZIRANI, UV

机构：

来源：

关键词：

D O I：

10.1016/0022-0000(86)90044-9

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：75 / 87

页数：13

共 18 条

[1]

BLUM M, 1984, SIAM J COMPUT, V13, P270

[2]

BLUM M, 1984, 25TH IEEE S F COMP S

[3]

Denning D.E.R., 1982, CRYPTOGRAPHY DATA SE, V112, DOI [10.5555/539308, DOI 10.5555/539308]

[4]

GALLAGER RG, 1968, INFORMATION THEORY R

[5] CLASS OF CONSTRUCTIVE ASYMPTOTICALLY GOOD ALGEBRAIC CODES [J].

JUSTESEN, J .

[6]

KENNEDY WJ, 1980, STATISTICAL COMPUTIN

[7] OPTIMIZATION BY SIMULATED ANNEALING [J].

KIRKPATRICK, S ;

GELATT, CD ;

VECCHI, MP .

[8]

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

[9]

Murry H. F., 1970, IEEE Transactions on Computers, VC-19, P1210, DOI 10.1109/T-C.1970.222860

[10] PROBABILISTIC ALGORITHM FOR TESTING PRIMALITY [J].

RABIN, MO .