A UNIFORM APPROACH TO OBTAIN DIAGONAL SETS IN COMPLEXITY CLASSES

被引：55

作者：

SCHONING, U

机构：

来源：

关键词：

D O I：

10.1016/0304-3975(82)90114-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：95 / 103

页数：9

共 13 条

[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]

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

[4]

BERMAN P, 1978, LECTURE NOTES COMPUT, V62, P63

CHEW, P ;

MACHTEY, M .

[6]

Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[7] STRUCTURE OF POLYNOMIAL TIME REDUCIBILITY [J].

LADNER, RE .

[8] ON THE STRUCTURE OF SETS IN NP AND OTHER COMPLEXITY CLASSES [J].

LANDWEBER, LH ;

LIPTON, RJ ;

ROBERTSON, EL .

[9]

LONG TJ, UNPUB THEOR COMPUT S

[10]

MEYER AR, 1979, MIT126 TECHN MEM