UNBIASED BITS FROM SOURCES OF WEAK RANDOMNESS AND PROBABILISTIC COMMUNICATION COMPLEXITY

被引：324

作者：

CHOR, B ^{[1
]}

GOLDREICH, O ^{[1
]}

机构：

[1] MIT, COMP SCI LAB, CAMBRIDGE, MA 02139 USA

来源：

关键词：

D O I：

10.1137/0217015

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：230 / 261

页数：32

共 36 条

[1]

Adleman L., 1978, 19th Annual Symposium on Foundations of Computer Science, P75, DOI 10.1109/SFCS.1978.37

[2]

AJTAI M, 1986, 18TH P ACM STOC, P30

[3]

Alon N., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P277, DOI 10.1109/SFCS.1985.30

[4]

ALON N, 1985, COMMUNICATION

[5]

ALON N, 1986, COMBINATORICA, V6, P231

BLUM, M .

[7]

BONDY JA, 1971, GRAPH THEORY APPLICA

[8] ON A PROBLEM OF OPPENHEIM CONCERNING FACTORISATIO NUMERORUM [J].

CANFIELD, ER ;

ERDOS, P ;

POMERANCE, C .

[9]

Chor B., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P429, DOI 10.1109/SFCS.1985.62

[10]

DIXON JD, 1981, MATH COMPUT, V36, P255, DOI 10.1090/S0025-5718-1981-0595059-1