RELATIVIZATIONS OF UNAMBIGUOUS AND RANDOM POLYNOMIAL-TIME CLASSES

被引：10

作者：

GESKE, J

GROLLMANN, J

机构：

[1] UNIV DORTMUND,LEHRSTUHL INFORMAT 1,D-4600 DORTMUND 50,FED REP GER

[2] IOWA STATE UNIV SCI & TECHNOL,DEPT COMP SCI,AMES,IA 50011

来源：

关键词：

D O I：

10.1137/0215035

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：511 / 519

页数：9

共 10 条

[1]

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

[2]

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

[3]

BALCAZAR JL, 1984, UNPUB IMMUNITY SIMPL

[4]

BOOK RV, 1984, SIAM J COMPUT, V13, P461, DOI 10.1137/0213030

EVEN, S ;

SELMAN, AL ;

YACOBI, Y .

INFORMATION AND CONTROL, 1984, 61 (02) :159-173

[6]

Grollmann J., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P495, DOI 10.1109/SFCS.1984.715952

[7] RELATIVIZED QUESTIONS INVOLVING PROBABILISTIC ALGORITHMS [J].

RACKOFF, C .

[8] IMMUNITY, RELATIVIZATIONS, AND NONDETERMINISM [J].

SCHONING, U ;

BOOK, RV .

[9]

SIPSER M, 1982, LECT NOTES COMPUT SC, V140, P523

[10]

Valiant L. G., 1976, Information Processing Letters, V5, P20, DOI 10.1016/0020-0190(76)90097-1