ON HELPING BY ROBUST ORACLE MACHINES

被引：34

作者：

KO, KI ^{[1
]}

机构：

[1] UNIV CALIF SANTA BARBARA,DEPT MATH,SANTA BARBARA,CA 93106

来源：

关键词：

D O I：

10.1016/0304-3975(87)90078-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：15 / 36

页数：22

共 17 条

[1]

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

[2]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3]

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

[4] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J].

GILL, J .

[5]

KARP R, 1980, 12TH P ACM S THEOR C, P302

[6] ON SELF-REDUCIBILITY AND WEAK P-SELECTIVITY [J].

KO, KI .

[7] ON CIRCUIT-SIZE COMPLEXITY AND THE LOW HIERARCHY IN NP [J].

KO, KI ;

SCHONING, U .

MAHANEY, SR .

[9]

MEYER A, 1979, MITLCSTM126 LAB COMP

[10] ROBUST ALGORITHMS - A DIFFERENT APPROACH TO ORACLES [J].

SCHONING, U .