{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:55:46Z","timestamp":1757627746483,"version":"3.44.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,4,2]],"date-time":"2004-04-02T00:00:00Z","timestamp":1080864000000},"content-version":"vor","delay-in-days":5024,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100005883","name":"Hertz Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005883","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-8508949"],"award-info":[{"award-number":["CCR-8508949"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,7]]},"DOI":"10.1016\/0304-3975(90)90177-j","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"249-263","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["Bi-immunity results for cheatable sets"],"prefix":"10.1016","volume":"73","author":[{"given":"Richard","family":"Beigel","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90177-J_BIB1","series-title":"Technical Report 2090","article-title":"Cheatable, p-terse, and p-superterse sets","author":"Amir","year":"1988"},{"key":"10.1016\/0304-3975(90)90177-J_BIB2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0890-5401(88)90044-2","article-title":"Polynomial terse sets","volume":"77","author":"Amir","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(90)90177-J_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","article-title":"Bi-immune sets for complexity classes","volume":"18","author":"Balcazar","year":"1985","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(90)90177-J_BIB4","unstructured":"R. Beigel, Bounded queries to SAT and the boolean hierarchy, Theoret. Comput. Sci., to appear."},{"key":"10.1016\/0304-3975(90)90177-J_BIB5","article-title":"NP-hard sets are p-superterse unless R = NP","volume":"4","author":"Beigel","year":"1988"},{"key":"10.1016\/0304-3975(90)90177-J_BIB6","series-title":"Ph.D. Thesis","article-title":"Query-limited reducibilities","author":"Beigel","year":"1988"},{"key":"10.1016\/0304-3975(90)90177-J_BIB7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/PSCT.1987.10319251","article-title":"A structural theorem that depends quantitatively on the complexity of SAT","author":"Beigel","year":"1987","journal-title":"Proc. 2nd Ann. Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(90)90177-J_BIB8","series-title":"Technical Report TR-1806","article-title":"Terse, superterse, and verbose sets","author":"Beigel","year":"1987"},{"key":"10.1016\/0304-3975(90)90177-J_BIB9","unstructured":"R. Beigel, W.I. Gasarch and L. Hay, Bounded query classes and the difference hierarchy, Ach. Math. Logic, to appear."},{"key":"10.1016\/0304-3975(90)90177-J_BIB10","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA\u2260NPA\u2260co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90177-J_BIB11","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90177-J_BIB12","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1137\/0217056","article-title":"On sets truth-table reducible to sparse sets","volume":"17","author":"Book","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90177-J_BIB13","series-title":"Technical Report TR-1652","article-title":"The complexity of optimization functions","author":"Gasarch","year":"1985"},{"key":"10.1016\/0304-3975(90)90177-J_BIB14","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1137\/0216042","article-title":"Oracles for deterministic versus alternating classes","volume":"16","author":"Gasarch","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90177-J_BIB15","series-title":"Proc. 4th Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"125","article-title":"A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees","volume":"247","author":"Geske","year":"1987"},{"key":"10.1016\/0304-3975(90)90177-J_BIB16","series-title":"Technical Report 87-11-05","article-title":"A note on bi-immunity and P-closeness of P-cheatable sets in P\/poly.","author":"Goldsmith","year":"1987"},{"key":"10.1016\/0304-3975(90)90177-J_BIB17","series-title":"Technical Report 87-11-11","article-title":"Using self-reducibilities to characterize polynomial time","author":"Goldsmith","year":"1987"},{"key":"10.1016\/0304-3975(90)90177-J_BIB18","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/S0019-9958(85)80004-8","article-title":"Sparse sets in NP - P: exptime verse nexptime","volume":"65","author":"Hartmanis","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90177-J_BIB19","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(83)90003-8","article-title":"Oracle dependent properties of the lattice of NP sets","volume":"24","author":"Homer","year":"1983","journal-title":"Theoret. Comput. Sci."},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/0304-3975(90)90177-J_BIB20"},{"key":"10.1016\/0304-3975(90)90177-J_BIB21","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/PSCT.1987.10319269","article-title":"On helping by robust oracle machines","author":"Ko","year":"1987","journal-title":"Proc. 2nd Ann. Conf. on Structure in Complexity Theory"},{"issue":"3","key":"10.1016\/0304-3975(90)90177-J_BIB22","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90177-J_BIB23","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."},{"key":"10.1016\/0304-3975(90)90177-J_BIB24","article-title":"Degree of difficulty of computing a function and a partial ordering of recursive sets","volume":"2","author":"Rabin","year":"1960"},{"key":"10.1016\/0304-3975(90)90177-J_BIB25","first-page":"322","article-title":"Optimal algorithms for self-reducible problems","author":"Schnorr","year":"1976","journal-title":"Proc. 3rd Internat. Coll. on Automata, Languages, and Programming"},{"key":"10.1016\/0304-3975(90)90177-J_BIB26","series-title":"Technical Report","article-title":"Natural self-reducible sets","author":"Selman","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090177J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090177J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:37Z","timestamp":1757477917000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090177J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["030439759090177J"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90177-j","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1990,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bi-immunity results for cheatable sets","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(90)90177-J","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}