SEPARATING, STRONGLY SEPARATING, AND COLLAPSING RELATIVIZED COMPLEXITY CLASSES

被引：0

|

作者：

BALCAZAR, JL

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1984年 / 176卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：1 / 16

页数：16

相关论文

共 50 条

[1] SEPARATING AND COLLAPSING RESULTS ON THE RELATIVIZED PROBABILISTIC POLYNOMIAL-TIME HIERARCHY
KO, KI
[J]. JOURNAL OF THE ACM, 1990, 37 (02) : 415 - 438
[2] SEPARATING COUNTING COMMUNICATION COMPLEXITY CLASSES
DAMM, C
KRAUSE, M
MEINEL, C
WAACK, S
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 281 - 292
[3] TECHNIQUES FOR SEPARATING SPACE COMPLEXITY CLASSES
SEIFERAS, JI
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1977, 14 (01) : 73 - 99
[4] LIMITATIONS ON SEPARATING NONDETERMINISTIC COMPLEXITY CLASSES
RACKOFF, CW
SEIFERAS, JI
[J]. SIAM JOURNAL ON COMPUTING, 1981, 10 (04) : 742 - 745
[5] SOME OBSERVATIONS ON SEPARATING COMPLEXITY CLASSES
BOOK, RV
[J]. SIAM JOURNAL ON COMPUTING, 1991, 20 (02) : 246 - 258
[6] SEPARATING NONDETERMINISTIC TIME COMPLEXITY CLASSES
SEIFERAS, JI
FISCHER, MJ
MEYER, AR
[J]. JOURNAL OF THE ACM, 1978, 25 (01) : 146 - 167
[7] SEPARATING COMPLEXITY CLASSES WITH TALLY ORACLES
HEMACHANDRA, LA
RUBINSTEIN, RS
[J]. THEORETICAL COMPUTER SCIENCE, 1992, 92 (02) : 309 - 318
[8] Separating complexity classes using autoreducibility
Buhrman, H
Fortnow, L
van Melkebeek, D
Torenvliet, L
[J]. SIAM JOURNAL ON COMPUTING, 2000, 29 (05) : 1497 - 1520
[9] ON SPARSE ORACLES SEPARATING FEASIBLE COMPLEXITY CLASSES
HARTMANIS, J
HEMACHANDRA, L
[J]. INFORMATION PROCESSING LETTERS, 1988, 28 (06) : 291 - 295
[10] Separating complexity classes using structural properties
Buhrman, H
Torenvliet, L
[J]. 19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 130 - 138

← 1 2 3 4 5 →