{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T03:18:09Z","timestamp":1775186289445,"version":"3.50.1"},"reference-count":48,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"vor","delay-in-days":5479,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0022-0000(89)90025-1","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"299-322","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":87,"title":["The strong exponential hierarchy collapses"],"prefix":"10.1016","volume":"39","author":[{"given":"Lane A.","family":"Hemachandra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90025-1_BIB1","series-title":"Proceedings, 3rd Structure in Complexity Theory Conference","first-page":"102","article-title":"Kolmogorov complexity and the degrees of tally sets","author":"Allender","year":"1988"},{"key":"10.1016\/0022-0000(89)90025-1_BIB2","article-title":"Bounded Queries to SAT and the Boolean Hierarchy","author":"Beigel","year":"1987"},{"issue":"No. 4","key":"10.1016\/0022-0000(89)90025-1_BIB3","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."},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90025-1_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90025-1_BIB5","series-title":"Proceedings, 3rd Structure in Complexity Theory Conference","first-page":"224","article-title":"On truth-table reducibility to SAT and the difference hierarchy over NP","author":"Buss","year":"1988"},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90025-1_BIB6","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/0213030","article-title":"Quantitative relativizations of complexity classes","volume":"13","author":"Book","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90025-1_BIB7","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0022-0000(85)90053-4","article-title":"Qualitative relativizations of complexity classes","volume":"30","author":"Book","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90025-1_BIB8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(81)90061-X","article-title":"Bounded query machines: On NP and PSPACE","volume":"15","author":"Book","year":"1981","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 1","key":"10.1016\/0022-0000(89)90025-1_BIB9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1137\/0218007","article-title":"The boolean hierarchy. II. Applications","volume":"18","author":"Cai","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"No. 6","key":"10.1016\/0022-0000(89)90025-1_BIB10","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1137\/0217078","article-title":"The boolean hierarchy. I. Structural properties","volume":"17","author":"Cai","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/0022-0000(89)90025-1_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"26","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90025-1_BIB12","series-title":"Proceedings, Ist Structure in Complexity Theory Conference","first-page":"125","article-title":"Exponential time and bounded arithmetic","volume":"Vol. 223","author":"Clote","year":"1986"},{"key":"10.1016\/0022-0000(89)90025-1_BIB13","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(89)90025-1_BIB14","first-page":"40","article-title":"Solvable problems with conflicting relativizations","volume":"27","author":"Hartmanis","year":"1985","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90025-1_BIB15","article-title":"Can P and NP Manufacture Randomness?","author":"Hemachandra","year":"1986"},{"key":"10.1016\/0022-0000(89)90025-1_BIB16","article-title":"THE SKY IS FALLING: The Strong Exponential Hierarchy Collapses","author":"Hemachandra","year":"1986"},{"key":"10.1016\/0022-0000(89)90025-1_BIB17","article-title":"Counting in Structural Complexity Theory","author":"Hemachandra","year":"1987"},{"key":"10.1016\/0022-0000(89)90025-1_BIB46","unstructured":"Cornell Department of Computer Science Technical Report TR87-840."},{"key":"10.1016\/0022-0000(89)90025-1_BIB18","series-title":"19th ACM Symposium on Theory of Computing","first-page":"110","article-title":"The strong exponential hierarchy collapses","author":"Hemachandra","year":"1987"},{"key":"10.1016\/0022-0000(89)90025-1_BIB19","series-title":"Proceedings, 2nd Structure in Complexity Theory Conference","article-title":"The strong exponential hierarchy collapses","author":"Hemachandra","year":"1987"},{"key":"10.1016\/0022-0000(89)90025-1_BIB20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(88)90022-9","article-title":"Complexity classes without machines: On complete languages for UP","volume":"58","author":"Hartmanis","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90025-1_BIB21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0020-0190(88)90176-7","article-title":"On sparse oracles separating feasible complexity classes","volume":"28","author":"Hartmanis","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"Nos 2\/3","key":"10.1016\/0022-0000(89)90025-1_BIB22","first-page":"159","article-title":"Sparse sets in NP-P: EXPTIME versus NEXPTIME","volume":"65","author":"Hartmanis","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(89)90025-1_BIB23","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. Soc."},{"key":"10.1016\/0022-0000(89)90025-1_BIB24","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(89)90025-1_BIB25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(84)90111-7","article-title":"Computation times of NP sets of different densities","volume":"34","author":"Hartmanis","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90025-1_BIB26","series-title":"Proceedings, 3rd Structure in Complexity Theory Conference","first-page":"112","article-title":"Nondeterministic space is closed under complementation","author":"Immerman","year":"1988"},{"key":"10.1016\/0022-0000(89)90025-1_BIB27","article-title":"Deterministic Polynomial Time with O(log(n)) Queries","author":"Kadin","year":"1986"},{"key":"10.1016\/0022-0000(89)90025-1_BIB28","series-title":"Proceedings, 2nd Structure in Complexity Theory Conference","first-page":"33","article-title":"PNP[logn] and sparse Turing-complete sets for NP","author":"Kadin","year":"1987"},{"key":"10.1016\/0022-0000(89)90025-1_BIB29","unstructured":"J. Kilian, June 1987, personal communication."},{"key":"10.1016\/0022-0000(89)90025-1_BIB30","article-title":"The Difference and Truth-Table Hierarchies for NP","author":"K\u00f6bler","year":"1986"},{"key":"10.1016\/0022-0000(89)90025-1_BIB31","series-title":"Automata, Languages, and Programming (ICALP 1987)","article-title":"The logarithmic alternation hierarchy collapses: A\u03a32L =A\u03a02L","author":"Lange","year":"1987"},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90025-1_BIB32","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90025-1_BIB33_1","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1137\/0214043","article-title":"On restricting the size of oracles compared with restricting access to oracles","volume":"14","author":"Long","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90025-1_BIB33_2","first-page":"628","volume":"17","author":"Long","year":"1988","journal-title":"Erratum"},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90025-1_BIB34","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90025-1_BIB35","series-title":"Proceedings, 6th GI Conference on Theoretical Computer Science","first-page":"269","article-title":"Two remarks on the power of counting","volume":"Vol. 145","author":"Papadimitriou","year":"1983"},{"key":"10.1016\/0022-0000(89)90025-1_BIB36","series-title":"Proceedings, 1st Structure in Complexity Theory Conference","volume":"Vol. 223","year":"1986"},{"key":"10.1016\/0022-0000(89)90025-1_BIB37","article-title":"A Study of the Structure of NP","author":"Sewelson","year":"1983"},{"key":"10.1016\/0022-0000(89)90025-1_BIB47","unstructured":"Cornell Department of Computer Science Technical Report No. 83-575."},{"key":"10.1016\/0022-0000(89)90025-1_BIB38","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1137\/0212037","article-title":"Positive relativizations of complexity classes","volume":"12","author":"Selman","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90025-1_BIB39","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."},{"key":"10.1016\/0022-0000(89)90025-1_BIB40","series-title":"STACS 1988: 5th Annual Symposium on Theoretical Aspects of Computer Science","article-title":"Collapsing oracle hierarchies, census functions, and logarithmically many queries","author":"Sch\u00f6ning","year":"1988"},{"key":"10.1016\/0022-0000(89)90025-1_BIB41","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0022-0000(87)90009-2","article-title":"\u03a32 SPACE[n] is closed under complement","volume":"35","author":"Toda","year":"1987","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90025-1_BIB42","series-title":"Proceedings, 3rd Structure in Complexity Theory Conference","first-page":"260","article-title":"Bounded query computation","author":"Wagner","year":"1988"},{"key":"10.1016\/0022-0000(89)90025-1_BIB43","unstructured":"O. Watanabe, May 1987, personal communication."},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90025-1_BIB44","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0212027","article-title":"On certain polynomial-time truth-table reducibilities of complete sets to sparse sets","volume":"12","author":"Yesha","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90025-1_BIB45","series-title":"Proceedings, 1st Structure in Complexity Theory Conference","first-page":"383","article-title":"Probabilistic quantifiers, adversaries, and complexity classes: An overview","author":"Zachos","year":"1986"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900251?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900251?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:10:52Z","timestamp":1757095852000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0022000089900251"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90025-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The strong exponential hierarchy collapses","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(89)90025-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}