{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:17:39Z","timestamp":1778296659057,"version":"3.51.4"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,10,27]],"date-time":"1998-10-27T00:00:00Z","timestamp":909446400000},"content-version":"vor","delay-in-days":56,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0304-3975(98)00006-1","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T23:26:12Z","timestamp":1049498772000},"page":"317-327","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Boolean operations, joins, and the extended low hierarchy"],"prefix":"10.1016","volume":"205","author":[{"given":"Lane A.","family":"Hemaspaandra","sequence":"first","affiliation":[]},{"given":"Zhigen","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[]},{"given":"Osamu","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00006-1_BIB1_1","series-title":"Some connections between bounded query classes and non-uniform complexity","author":"Amir","year":"1994"},{"key":"10.1016\/S0304-3975(98)00006-1_BIB1_2","series-title":"Proc. 5th Structure in Complexity Theory Conf., IEEE Computer Society Press","first-page":"232","author":"Amir","year":"1990"},{"issue":"1","key":"10.1016\/S0304-3975(98)00006-1_BIB2","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/147508.147546","article-title":"Lower bounds for the low hierarchy","volume":"39","author":"Allender","year":"1992","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0304-3975(98)00006-1_BIB3","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1137\/0215053","article-title":"Sparse sets, lowness and highness","volume":"15","author":"Balc\u00e1zar","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00006-1_BIB4","series-title":"Randomness and Computation","first-page":"143","article-title":"Almost optimal lower bounds for small depth circuits","volume":"vol. 5","author":"H\u00e5stad","year":"1989"},{"issue":"2","key":"10.1016\/S0304-3975(98)00006-1_BIB5","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/156063.156064","article-title":"Lowness: a yardstick for NP-P","volume":"24","author":"Hemaspaandra","year":"1993","journal-title":"SIGACT News"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(98)00006-1_BIB6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(94)00290-Y","article-title":"P-selectivity: intersections and indices","volume":"145","author":"Hemaspaandra","year":"1995","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(98)00006-1_BIB7","first-page":"197","article-title":"Polynomial-time multi-selectivity","volume":"3","author":"Hemaspaandra","year":"1997","journal-title":"J. Universal Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(98)00006-1_BIB8","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S0097539794268315","article-title":"Computing solutions uniquely collapses the polynomial hierarchy","volume":"25","author":"Hemaspaandra","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00006-1_BIB9_1","series-title":"Proc. 12th ACM Symp. on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/S0304-3975(98)00006-1_BIB9_2","first-page":"191","article-title":"Turing machines that take advice","author":"Karp","year":"1982","journal-title":"L\u2032Enseignement Math\u00e9matique, 2nd series 28"},{"key":"10.1016\/S0304-3975(98)00006-1_BIB10","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0890-5401(91)90002-J","article-title":"Separating the low and high hierarchies by oracles","volume":"90","author":"Ko","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00006-1_BIB11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(94)00016-6","article-title":"Locating P\/poly optimally in the extended low hierarchy","volume":"134","author":"K\u00f6bler","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00006-1_BIB12","series-title":"Proc. 10th Structure in Complexity Theory Conf., IEEE Computer Society Press","first-page":"246","article-title":"On the structure of low sets","author":"K\u00f6bler","year":"1995"},{"issue":"1","key":"10.1016\/S0304-3975(98)00006-1_BIB13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0214003","article-title":"On circuit-size complexity and the low hierarchy in NP","volume":"14","author":"Ko","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00006-1_BIB14","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 space","author":"Meyer","year":"1972"},{"issue":"5","key":"10.1016\/S0304-3975(98)00006-1_BIB15","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1137\/S0097539793258131","article-title":"Polynomial-time membership comparable sets","volume":"24","author":"Ogihara","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(98)00006-1_BIB16","article-title":"On some promise classes in structural complexity theory","author":"Rothe","year":"1995"},{"key":"10.1016\/S0304-3975(98)00006-1_BIB17","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(98)00006-1_BIB18","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0022-0000(88)90010-4","article-title":"Graph isomorphism is in the low hierarchy","volume":"37","author":"Sch\u00f6ning","year":"1987","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/S0304-3975(98)00006-1_BIB19","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0022-0000(89)90020-2","article-title":"Probabilistic complexity classes and lowness","volume":"39","author":"Sch\u00f6ning","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00006-1_BIB20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. Systems Theory"},{"issue":"3","key":"10.1016\/S0304-3975(98)00006-1_BIB21","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/S0097539791218640","article-title":"The extended low hierarchy is an infinite hierarchy","volume":"23","author":"Sheu","year":"1994","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/S0304-3975(98)00006-1_BIB22","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:S0304397598000061?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000061?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:39Z","timestamp":1759625499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0304397598000061"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00006-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Boolean operations, joins, and the extended low hierarchy","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(98)00006-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}