{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:17:37Z","timestamp":1778296657724,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":4429,"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":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00146-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"305-321","source":"Crossref","is-referenced-by-count":5,"title":["On boolean lowness and boolean highness"],"prefix":"10.1016","volume":"261","author":[{"given":"Steffen","family":"Reith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus W.","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00146-8_BIB1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01371729","article-title":"A relationship between difference hierarchies and relativized polynomial hierarchies","volume":"26","author":"Beigel","year":"1993","journal-title":"Math. Systems Theory"},{"issue":"6","key":"10.1016\/S0304-3975(00)00146-8_BIB2","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1137\/0217078","article-title":"The boolean hierarchy I","volume":"17","author":"Cai","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00146-8_BIB3","first-page":"105","volume":"Vol. 223","author":"Cai","year":"1986"},{"key":"10.1016\/S0304-3975(00)00146-8_BIB4","unstructured":"R. Chang, Bounded queries, approximation and the boolean hierarchy, Tech. Rep. CS 97-04, University of Maryland, Department of Computer Science and Electrical Engineering, 1997."},{"issue":"2","key":"10.1016\/S0304-3975(00)00146-8_BIB5","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1137\/S0097539790178069","article-title":"The boolean hierarchy and the polynomial hierarchy","volume":"25","author":"Chang","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00146-8_BIB6","doi-asserted-by":"crossref","first-page":"655","DOI":"10.2307\/2272849","article-title":"Minimal pairs and high recursively enumerable degree","volume":"39","author":"Cooper","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(00)00146-8_BIB7","doi-asserted-by":"crossref","unstructured":"E. Hemaspaandra, L.A. Hemaspaandra, H. Hempel, What's up with downward collapse: using the easy-hard technique to link boolean and polynomial hierarchy collapses, UR-CS-TR-98-682, University of Rochester, Department of Computer Science, 1998.","DOI":"10.1145\/300307.300308"},{"issue":"6","key":"10.1016\/S0304-3975(00)00146-8_BIB8","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1137\/0217080","article-title":"The polynomial time hierarchy collapses if the boolean hierarchy collapses","volume":"17","author":"Kadin","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00146-8_BIB9","series-title":"Some connections between nonuniform and uniform complexity classes, Proc. 12th ACM STOC","first-page":"302","author":"Karp","year":"1980"},{"key":"10.1016\/S0304-3975(00)00146-8_BIB10","unstructured":"J. K\u00f6bler, Untersuchungen verschiedener polynomieller Reduktionsklassen von NP, Diploma Thesis, Universit\u00e4t Stuttgart, 1985."},{"issue":"4","key":"10.1016\/S0304-3975(00)00146-8_BIB11","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1987210404191","article-title":"he difference and truth-table hierarchies for NP","volume":"21","author":"K\u00f6bler","year":"1987","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(00)00146-8_BIB12","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0022-0000(83)90027-2","article-title":"A low and a high hierarchy within NP","volume":"27","author":"Sch\u00f6ning","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00146-8_BIB13","volume":"Vol. 211","author":"Sch\u00f6ning","year":"1985"},{"key":"10.1016\/S0304-3975(00)00146-8_BIB14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1090\/S0002-9904-1974-13350-1","article-title":"Automorphisms of the lattice of recursively enumerable sets","volume":"80","author":"Soare","year":"1974","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00146-8_BIB15","unstructured":"K.W. Wagner, Number-of-query hierachies, Tech. Rep. 158, University of Augsburg, 1987."},{"key":"10.1016\/S0304-3975(00)00146-8_BIB16","unstructured":"K.W. Wagner, A note on bounded queries and the difference hierarchy, Tech. Rep. 173, Institut f\u00fcr Informatik, Universit\u00e4t W\u00fcrzburg, 1997."},{"key":"10.1016\/S0304-3975(00)00146-8_BIB17","first-page":"485","volume":"Vol. 199","author":"Wechsung","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001468?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001468?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T04:48:10Z","timestamp":1578458890000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001468"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00146-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}