Separating classes in the exponential-time hierarchy from classes in PH
type: Item
instance of: scholarly article
title: Separating classes in the exponential-time hierarchy from classes in PH
zbMATH Open document ID: 0877.68057
DOI: 10.1016/0304-3975(95)00078-X
author: Sarah E. Mocas
published in: Theoretical Computer Science
publication date: 1997-09-07T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1058510
zbMATH Keywords: exponential-time hierarchy
MaRDI profile type: Publication
cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
cites work: Q3996675
cites work: Quasi-realtime languages
cites work: On the cutting edge of relativization: The resource bounded injury method
cites work: Alternation
cites work: A hierarchy for nondeterministic time complexity
cites work: Sparse sets in NP-P: EXPTIME versus NEXPTIME
cites work: On the Computational Complexity of Algorithms
cites work: The strong exponential hierarchy collapses
cites work: Nondeterministic Space is Closed under Complementation
cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
cites work: The polynomial-time hierarchy
description: scientific article; zbMATH DE number 1058510