WITH PROBABILITY ONE, A RANDOM ORACLE SEPARATES PSPACE FROM THE POLYNOMIAL-TIME HIERARCHY

被引:42
作者
CAI, JY
机构
关键词
D O I
10.1016/0022-0000(89)90033-0
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:68 / 85
页数:18
相关论文
共 12 条
  • [1] SIGMA-11-FORMULAE ON FINITE STRUCTURES
    AJTAI, M
    [J]. ANNALS OF PURE AND APPLIED LOGIC, 1983, 24 (01) : 1 - 48
  • [2] BABAI L, 1986, IN PRESS RANDOM ORAC
  • [3] Baker T., 1975, SIAM Journal on Computing, V4, P431, DOI 10.1137/0204037
  • [4] Baker T. P., 1979, Theoretical Computer Science, V8, P177, DOI 10.1016/0304-3975(79)90043-4
  • [5] RELATIVE TO A RANDOM ORACLE-A, PA NOT-EQUAL NPA NOT-EQUAL CO-NPA WITH PROBABILITY-1
    BENNETT, CH
    GILL, J
    [J]. SIAM JOURNAL ON COMPUTING, 1981, 10 (01) : 96 - 113
  • [6] CAI JY, 1986, LECT NOTES COMPUT SC, V223, P105
  • [7] CHANDRA A, 1981, J ASS COMPUT MACH, V26
  • [8] PARITY, CIRCUITS, AND THE POLYNOMIAL-TIME HIERARCHY
    FURST, M
    SAXE, JB
    SIPSER, M
    [J]. MATHEMATICAL SYSTEMS THEORY, 1984, 17 (01): : 13 - 27
  • [9] Hopcroft JE., 2001, INTRO AUTOMATA THEOR, V2nd
  • [10] SIPSER M, P ACM S THEORY COMPU, P61