RELATIVE TO A RANDOM ORACLE-A, PA NOT-EQUAL NPA NOT-EQUAL CO-NPA WITH PROBABILITY-1

被引：220

作者：

BENNETT, CH ^{[1
]}

GILL, J ^{[1
]}

机构：

[1] STANFORD UNIV,DEPT ELECT ENGN,STANFORD,CA 94305

来源：

关键词：

D O I：

10.1137/0210008

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：96 / 113

页数：18

共 28 条

[1]

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

[2]

ADLEMAN LM, 1977, 9TH P ACN S THEOR CO, P151

[3]

ANGLUIN D, UNPUBLISHED

[4]

Baker T., 1975, SIAM Journal on Computing, V4, P431, DOI 10.1137/0204037

[5]

BAKER T, 1976, 17TH P F COMP SCI, P71

[6]

BARZDIN Y, 1969, SOVIET MATH DOKL, V10, P1464

[7]

Berman L., 1977, SIAM Journal on Computing, V6, P305, DOI 10.1137/0206023

[8] RELATIVIZED CRYPTOGRAPHY [J].

BRASSARD, G .

[9] THEORY OF PROGRAM SIZE FORMALLY IDENTICAL TO INFORMATION-THEORY [J].

CHAITIN, GJ .

[10]

DELEEUW K, 1956, AN MATH STUDIES, V34, P182