{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:18:25Z","timestamp":1778296705237,"version":"3.51.4"},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":8052,"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":[[1991,7]]},"DOI":"10.1016\/0304-3975(91)90160-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"199-223","source":"Crossref","is-referenced-by-count":70,"title":["Bounded queries to SAT and the Boolean hierarchy"],"prefix":"10.1016","volume":"84","author":[{"given":"Richard","family":"Beigel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90160-4_BIB1","series-title":"Proc. 5th Ann. Conf. on Structure in Complexity Theory","first-page":"232","article-title":"Some connections between bounded query classes and non-uniform complexity","author":"Amir","year":"1990"},{"key":"10.1016\/0304-3975(91)90160-4_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(91)90160-4_BIB3","article-title":"Structural complexity I","volume":"11","author":"Balc\u00e1zar","year":"1988","journal-title":"EATCS Monogr. Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90160-4_BIB4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(90)90177-J","article-title":"Bi-immunity results for cheatable sets","volume":"73","author":"Beigel","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90160-4_BIB5","series-title":"Tech. Report 4","article-title":"NP-hard sets are p-superterse unless R = NP","author":"Beigel","year":"1988"},{"key":"10.1016\/0304-3975(91)90160-4_BIB6","series-title":"Ph.D. Thesis","article-title":"Query-limited reducibilities","author":"Beigel","year":"1987"},{"key":"10.1016\/0304-3975(91)90160-4_BIB7","series-title":"Proc. 2nd Ann. Conf. on Structure in Complexity Theory","first-page":"28","article-title":"A structural theorem that depends quantitatively on the complexity of SAT","author":"Beigel","year":"1987"},{"key":"10.1016\/0304-3975(91)90160-4_BIB8","series-title":"Tech. Report 6","article-title":"When are k + 1 queries better than k?","author":"Beigel","year":"1988"},{"key":"10.1016\/0304-3975(91)90160-4_BIB9","doi-asserted-by":"crossref","unstructured":"R. Beigel, W. I. Gasarch, J. T. Gill and J. C. Owings, Jr., Terse, superterse, and verbose sets, Inform. and Comput., to appear.","DOI":"10.1006\/inco.1993.1014"},{"key":"10.1016\/0304-3975(91)90160-4_BIB10","doi-asserted-by":"crossref","unstructured":"R. Beigel, W.I. Gasarch and L. Hay. Bounded query classes and the difference hierarchy, Arch. Math. Logic, to appear.","DOI":"10.1007\/BF01620618"},{"key":"10.1016\/0304-3975(91)90160-4_BIB11","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(91)90160-4_BIB12","series-title":"Proc. 3rd Ann. Conf. on Structure in Complexity Theory","first-page":"224","article-title":"On truth table reducibility to SAT and the difference hierarchy over NP","author":"Buss","year":"1988"},{"key":"10.1016\/0304-3975(91)90160-4_BIB13","series-title":"Ph.D. Thesis","article-title":"On some most probable separations of complexity classes","author":"Cai","year":"1986"},{"key":"10.1016\/0304-3975(91)90160-4_BIB14","series-title":"Structure in Complexity Theory","first-page":"105","article-title":"The Boolean hierarchy: hardware over NP","volume":"Vol. 223","author":"Cai","year":"1986"},{"key":"10.1016\/0304-3975(91)90160-4_BIB15","series-title":"Tech. Report 87-11-11","article-title":"Using self-reducibilities to characterize polynomial time","author":"Goldsmith","year":"1987"},{"key":"10.1016\/0304-3975(91)90160-4_BIB16","article-title":"The strong exponential hierarchy collapses","author":"Hemachandra","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90160-4_BIB17","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1987210404191","article-title":"The difference and truth-table hierarchies for NP","volume":"21","author":"K\u00f6bler","year":"1987","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"issue":"3","key":"10.1016\/0304-3975(91)90160-4_BIB18","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(91)90160-4_BIB19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/320941.320945","article-title":"On the inversion complexity of a system of functions","volume":"6","author":"Markov","year":"1958","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(91)90160-4_BIB20","series-title":"Tech. Report MIT\/LCS\/TM-126","article-title":"With what frequency are apparently intractable problems difficult?","author":"Meyer","year":"1979"},{"issue":"3","key":"10.1016\/0304-3975(91)90160-4_BIB21","doi-asserted-by":"crossref","first-page":"761","DOI":"10.2307\/2274739","article-title":"A cardinality version of Beigel's Nonspeedup Theorem","volume":"54","author":"Owings","year":"1989","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(91)90160-4_BIB22","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","article-title":"The complexity of facets (and some facets of complexity)","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(91)90160-4_BIB23","series-title":"Proc. 6th GI Conf. of Theoretical Computer Science","first-page":"269","article-title":"Two remarks on the complexity of counting","volume":"Vol. 145","author":"Papadimitriou","year":"1983"},{"issue":"1","key":"10.1016\/0304-3975(91)90160-4_BIB24","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2307\/2270581","article-title":"Trial and error predicates and the solution to a problem of Mostowski","volume":"30","author":"Putnam","year":"1965","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(91)90160-4_BIB25","series-title":"Ph.D. Thesis","article-title":"Structural properties of complexity classes","author":"Russo","year":"1985"},{"key":"10.1016\/0304-3975(91)90160-4_BIB26","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(91)90160-4_BIB27","series-title":"Tech. Report 140","article-title":"Collapsing oracle hierarchies, census functions, and logarithmically many queries","author":"Sch\u00f6ning","year":"1987"},{"key":"10.1016\/0304-3975(91)90160-4_BIB28","series-title":"Tech. Report 157","article-title":"Bounded query classes","author":"Wagner","year":"1987"},{"key":"10.1016\/0304-3975(91)90160-4_BIB29","series-title":"Proc. 1985 Internat. Conf. on Fundamentals of Computation Theory","first-page":"485","article-title":"On the Boolean closure of NP","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:0304397591901604?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591901604?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:33Z","timestamp":1555127673000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591901604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["0304397591901604"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90160-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}