메뉴 건너뛰기




Volumn 158, Issue 1-2, 1996, Pages 221-231

Separating classes in the exponential-time hierarchy from classes in PH

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; HIERARCHICAL SYSTEMS; POLYNOMIALS; QUERY LANGUAGES; SET THEORY;

EID: 0030149265     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00078-X     Document Type: Article
Times cited : (10)

References (19)
  • 1
    • 0001455590 scopus 로고
    • Relativizations of the P =? NP question
    • T. Baker, J. Gill and R. Solovay, Relativizations of the P =? NP question, SIAM J. Comput., 4 (1975) 431-442.
    • (1975) SIAM J. Comput. , vol.4 , pp. 431-442
    • Baker, T.1    Gill, J.2    Solovay, R.3
  • 4
    • 84951149433 scopus 로고
    • On the cutting edge of relativization: The resource bounded injury method
    • Lecture Notes in Computer Science, Springer, Berlin
    • H. Buhrman and L. Torenvliet, On the cutting edge of relativization: the resource bounded injury method, in Ann. Internat. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 820 (Springer, Berlin, 1994) 263-273.
    • (1994) Ann. Internat. Coll. on Automata, Languages and Programming , vol.820 , pp. 263-273
    • Buhrman, H.1    Torenvliet, L.2
  • 6
    • 0015816246 scopus 로고
    • A hierarchy for nondeterministic time complexity
    • S.A. Cook, A hierarchy for nondeterministic time complexity, J. Comput. System Sci., 7 (1973) 343-353.
    • (1973) J. Comput. System Sci. , vol.7 , pp. 343-353
    • Cook, S.A.1
  • 8
    • 0022065165 scopus 로고
    • Sparse sets in NP-P: EXPTIME versus NEXPTIME
    • J. Hartmanis, N. Immerman and V. Sewelson, Sparse sets in NP-P: EXPTIME versus NEXPTIME. Inform. Control 65 (1985) 158-181.
    • (1985) Inform. Control , vol.65 , pp. 158-181
    • Hartmanis, J.1    Immerman, N.2    Sewelson, V.3
  • 9
    • 84968502725 scopus 로고
    • On the computational complexity of algorithms
    • J. Hartmanis and R. Steams, On the computational complexity of algorithms, Trans. Amer. Math. Society, 117 (1965) 285-306.
    • (1965) Trans. Amer. Math. Society , vol.117 , pp. 285-306
    • Hartmanis, J.1    Steams, R.2
  • 11
    • 0000542612 scopus 로고
    • The strong exponential hierarchy collapses
    • L. Hemachandra, The strong exponential hierarchy collapses, J. Comput. System Sci., 39 (1989) 299-322.
    • (1989) J. Comput. System Sci. , vol.39 , pp. 299-322
    • Hemachandra, L.1
  • 12
    • 0024091298 scopus 로고
    • Nondeterministic space is closed under complementation
    • N. Immerman, Nondeterministic space is closed under complementation, SIAM J. Comput. 17 (1988) 935-938.
    • (1988) SIAM J. Comput. , vol.17 , pp. 935-938
    • Immerman, N.1
  • 14
    • 0000359018 scopus 로고
    • Sparse complete sets for NP: Solutions of a conjecture of Berman and Hartmanis
    • S. Mahaney, Sparse complete sets for NP: solutions of a conjecture of Berman and Hartmanis, J. Comput. Systems Sci. 25 (1982) 130-143.
    • (1982) J. Comput. Systems Sci. , vol.25 , pp. 130-143
    • Mahaney, S.1
  • 19
    • 44649167785 scopus 로고
    • The polynomial-time hierarchy
    • L. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1977) 1-22.
    • (1977) Theoret. Comput. Sci. , vol.3 , pp. 1-22
    • Stockmeyer, L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.