ROBUST ALGORITHMS - A DIFFERENT APPROACH TO ORACLES

被引：23

作者：

SCHONING, U

机构：

[1] UNIV STUTTGART,INST INFORMAT,D-7000 STUTTGART 1,FED REP GER

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

来源：

关键词：

D O I：

10.1016/0304-3975(85)90158-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：57 / 66

页数：10

共 19 条

[1]

ADELSONVELSKII GM, 1981, LECTURE NOTES COMPUT, V122, P315

[2]

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

[3]

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

[4]

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

[5]

BRASSARD G, 1978, TR78338 CORN U DEP C

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

GILL, J .

[7]

Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[8] POWER OF DOMINANCE RELATIONS IN BRANCH-AND-BOUND ALGORITHMS [J].

IBARAKI, T .

[9]

JANIGE L, 1984, UNPUB

[10]

KARP R, 1982, MONOGRAPHIE ENS MATH, V30, P255