ON RELATIVIZED EXPONENTIAL AND PROBABILISTIC COMPLEXITY CLASSES

被引：33
作者：
HELLER, H
机构：
来源：
INFORMATION AND CONTROL | 1986年 / 71卷 / 03期
关键词：
D O I：
10.1016/S0019-9958(86)80012-2
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：231 / 243
页数：13
相关论文
共 21 条
[11]   SOME OBSERVATIONS ON THE PROBABILISTIC ALGORITHMS AND NP-HARD PROBLEMS [J].
KO, KI .
INFORMATION PROCESSING LETTERS, 1982, 14 (01) :39-43
[12]  
KURTZ S, 1983, C COMPUTATIONAL COMP, P42
[13]   BPP AND THE POLYNOMIAL HIERARCHY [J].
LAUTEMANN, C .
INFORMATION PROCESSING LETTERS, 1983, 17 (04) :215-217
[14]   A NOTE ON SPARSE ORACLES FOR NP [J].
LONG, TJ .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 24 (02) :224-232
[15]  
LONG TJ, 1978, THESIS PURDUE U LAFA
[16]   SPARSE COMPLETE-SETS FOR NP - SOLUTION OF A CONJECTURE OF BERMAN AND HARTMANIS [J].
MAHANEY, SR .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 25 (02) :130-143
[17]  
Rogers Jr. H., 1967, MCGRAW HILL SERIES H
[18]  
Sipser M., 1983, P 15 ANN ACM S THEOR, P330
[19]  
Stockmeyer L. J., 1983, P 15 ANN ACM S THEOR, P118
[20]  
Wilson C. B., 1983, 24th Annual Symposium on Foundations of Computer Science, P329, DOI 10.1109/SFCS.1983.66
123