{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T09:05:17Z","timestamp":1748336717438},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00078-x","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"221-231","source":"Crossref","is-referenced-by-count":6,"title":["Separating classes in the exponential-time hierarchy from classes in PH"],"prefix":"10.1016","volume":"158","author":[{"given":"Sarah E.","family":"Mocas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00078-X_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P =? NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00078-X_BIB2","volume":"Vol. II","author":"Balc\u00e1zar","year":"1990"},{"key":"10.1016\/0304-3975(95)00078-X_BIB3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01705890","article-title":"Quasi-realtime languages","volume":"4","author":"Book","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00078-X_BIB4","series-title":"Ann. Internat. Coll. on Automata, Languages and Programming","first-page":"263","article-title":"On the cutting edge of relativization: the resource bounded injury method","volume":"Vol. 820","author":"Buhrman","year":"1994"},{"key":"10.1016\/0304-3975(95)00078-X_BIB5","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00078-X_BIB6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0022-0000(73)80028-5","article-title":"A hierarchy for nondeterministic time complexity","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00078-X_BIB7","series-title":"Proc. IEEE Structure in Complexity Theory","first-page":"50","article-title":"Some properties of exponential time complexity classes","author":"Fu","year":"1992"},{"key":"10.1016\/0304-3975(95)00078-X_BIB8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/S0019-9958(85)80004-8","article-title":"Sparse sets in NP-P: EXPTIME versus NEXPTIME","volume":"65","author":"Hartmanis","year":"1985","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(95)00078-X_BIB9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Society"},{"key":"10.1016\/0304-3975(95)00078-X_BIB10","article-title":"Counting in structural complexity theory","author":"Hemachandra","year":"1987"},{"key":"10.1016\/0304-3975(95)00078-X_BIB11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0022-0000(89)90025-1","article-title":"The strong exponential hierarchy collapses","volume":"39","author":"Hemachandra","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00078-X_BIB12","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00078-X_BIB13","series-title":"Proc. 2th IEEE Structure in Complexity Theory","first-page":"33","article-title":"PNP[log] and sparse Turing complete sets for NP","author":"Kadin","year":"1987"},{"key":"10.1016\/0304-3975(95)00078-X_BIB14","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for NP: solutions of a conjecture of Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(95)00078-X_BIB15","series-title":"Proc. 13th IEEE Symp. on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential time","author":"Meyer","year":"1973"},{"key":"10.1016\/0304-3975(95)00078-X_BIB16","article-title":"Separating exponential time classes from polynomial time classes","author":"Mocas","year":"1993"},{"key":"10.1016\/0304-3975(95)00078-X_BIB17","series-title":"Proc. 14th IEEE Symp. on Switching and Automata Theory","first-page":"130","article-title":"Refinements of nondeterministic time and space hierarchies","author":"Seiferas","year":"1973"},{"key":"10.1016\/0304-3975(95)00078-X_BIB18","article-title":"On some central problems in computaional complexity","author":"Simon","year":"1975"},{"key":"10.1016\/0304-3975(95)00078-X_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500078X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500078X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T05:26:48Z","timestamp":1556256408000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500078X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["030439759500078X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00078-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}