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

Theoretical Computer Science

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

  Mocas, Sarah E ^a  

^a Portland State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

EXPONENTIAL TIME HIERARCHY; POLYNOMIAL TIME HIERARCHY; TIME HIERARCHY THEOREM;

COMPUTATIONAL METHODS;

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

References (19)

1. T. Baker, J. Gill and R. Solovay, Relativizations of the P =? NP question, SIAM J. Comput., 4 (1975) 431-442.
2. J. Balcázar, J. Díaz and J. Gabarró, Structural Complexity, Vol. II(Springer, New York, 1990).
3. R. Book and S. Greibach, Quasi-realtime languages, Math. Systems Theory 4 (1970) 97-111.
4. 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.
5. A.K. Chandra, D. Kozen and L. Stockmeyer, Alternation, J. ACM 28 (1981) 114-133.
6. S.A. Cook, A hierarchy for nondeterministic time complexity, J. Comput. System Sci., 7 (1973) 343-353.
7. B. Fu, H. Li and Y. Zhong, Some properties of exponential time complexity classes, in: Proc. IEEE Structure in Complexity Theory (1992) 50-57.
8. J. Hartmanis, N. Immerman and V. Sewelson, Sparse sets in NP-P: EXPTIME versus NEXPTIME. Inform. Control 65 (1985) 158-181.
9. J. Hartmanis and R. Steams, On the computational complexity of algorithms, Trans. Amer. Math. Society, 117 (1965) 285-306.
10. L.A. Hemachandra, Counting in structural complexity theory, Ph.D. Thesis, Computer Science Dept. Cornell Univ. 1987.
11. L. Hemachandra, The strong exponential hierarchy collapses, J. Comput. System Sci., 39 (1989) 299-322.
12. N. Immerman, Nondeterministic space is closed under complementation, SIAM J. Comput. 17 (1988) 935-938.
13. NP[log] and sparse Turing complete sets for NP, In: Proc. 2th IEEE Structure in Complexity Theory (1987) 33-40.
14. S. Mahaney, Sparse complete sets for NP: solutions of a conjecture of Berman and Hartmanis, J. Comput. Systems Sci. 25 (1982) 130-143.
15. A.R. Meyer and L. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential time, in: Proc. 13th IEEE Symp. on Switching and Automata Theory (1973) 125-129.
16. S.E. Mocas, Separating exponential time classes from polynomial time classes, Ph.D. Thesis, College of Computer Science, Northeastern Univ. 1993.
17. J.I. Seiferas, M.J. Fischer and A.R. Meyer, Refinements of nondeterministic time and space hierarchies, in: Proc. 14th IEEE Symp. on Switching and Automata Theory (1973) 130-137.
18. J. Simon, On some central problems in computaional complexity, Ph.D. Thesis, Dept. of Computer Science, Cornell Univ. Ithaca, NY, 1975.
19. L. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1977) 1-22.