{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:14:36Z","timestamp":1781345676849,"version":"3.54.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":8174,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0890-5401(91)90075-d","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"86-102","source":"Crossref","is-referenced-by-count":68,"title":["On truth-table reducibility to SAT"],"prefix":"10.1016","volume":"91","author":[{"given":"Samuel R.","family":"Buss","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louise","family":"Hay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90075-D_BIB1","article-title":"Bounded queries to SAT and the Boolean hierarchy","author":"Beigel","year":"1987","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0890-5401(91)90075-D_BIB2","article-title":"Bounded Arithmetic, Bibliopolis, Napoli; revision of 1985 Princeton","author":"Buss","year":"1986","journal-title":"University Ph.D. thesis"},{"key":"10.1016\/0890-5401(91)90075-D_BIB3","series-title":"Proceedings, Workshop in Logic and Computation","first-page":"57","article-title":"Axiomatizations and conservation results for fragments of bounded arithmetic","volume":"106","author":"Buss","year":"1990"},{"key":"10.1016\/0890-5401(91)90075-D_BIB4","series-title":"Proceedings, Structure in Complexity Conference","first-page":"224","article-title":"On truth-table reducibility to SAT and the difference hierarchy over NP","author":"Buss","year":"1988"},{"key":"10.1016\/0890-5401(91)90075-D_BIB5","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."},{"key":"10.1016\/0890-5401(91)90075-D_BIB6","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."},{"key":"10.1016\/0890-5401(91)90075-D_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-16486-3_93","article-title":"The Boolean Hierarchy: Hardware over NP","author":"Cai","year":"1985"},{"key":"10.1016\/0890-5401(91)90075-D_BIB8","series-title":"Structure in Complexity","first-page":"105","article-title":"The Boolean hierarchy: Hardware over NP","volume":"Vol. 223","author":"Cai","year":"1986"},{"key":"10.1016\/0890-5401(91)90075-D_BIB9","series-title":"Proceedings, 27th Annual Symposium on Foundations of Computer Science","first-page":"390","article-title":"Three results on polynomial isomorphism of complete sets","author":"Goldsmith","year":"1986"},{"key":"10.1016\/0890-5401(91)90075-D_BIB10","author":"Hausdorff","year":"1978"},{"key":"10.1016\/0890-5401(91)90075-D_BIB11","series-title":"Proceedings, 19th Annual ACM Symposium on Theory of Computing","first-page":"299","article-title":"The strong exponential hierarchy collapses","volume":"39","author":"Hemachandra","year":"1989"},{"issue":"1989","key":"10.1016\/0890-5401(91)90075-D_BIB12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0890-5401(89)90012-6","article-title":"The logarithmic alternation hierarchy collapses: A\u03a32L = A\u03a02L","volume":"80","author":"Jenner","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(91)90075-D_BIB13","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":"Informatique Th\u00e9orique et Applications"},{"key":"10.1016\/0890-5401(91)90075-D_BIB14","series-title":"Proceedings, 18th Annual ACM Symposium on Theory of Computing","first-page":"69","article-title":"The complexity of optimization problems","author":"Krentel","year":"1986"},{"key":"10.1016\/0890-5401(91)90075-D_BIB15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log space complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0890-5401(91)90075-D_BIB16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01683260","article-title":"Relativization of questions about log space computability","volume":"10","author":"Ladner","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(91)90075-D_BIB22","doi-asserted-by":"crossref","unstructured":"Ladner, R. E., Lynch, N. A., and Selman, A. L. A comparison of polynomial time reducibilities, Theoret. Comput. Sci.1, 103\u2013123.","DOI":"10.1016\/0304-3975(75)90016-X"},{"key":"10.1016\/0890-5401(91)90075-D_BIB17","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/322033.322037","article-title":"Log space recognition and translation of parenthesis languages","volume":"24","author":"Lynch","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90075-D_BIB18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","article-title":"More complicated questions about maxima and minima, and some closures of NP","volume":"51","author":"Wagner","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90075-D_BIB19","series-title":"Proceedings, Structure in Complexity Theory Conference","first-page":"260","article-title":"Bounded query classes","author":"Wagner","year":"1988"},{"key":"10.1016\/0890-5401(91)90075-D_BIB20","series-title":"Automata, Languages and Programming","first-page":"682","article-title":"On restricting the access to an NP oracle","volume":"Vol. 317","author":"Wagner","year":"1988"},{"key":"10.1016\/0890-5401(91)90075-D_BIB21","series-title":"Proceedings, Int'l Conf. on Fundamentals Computation Theory","first-page":"485","article-title":"On the Boolean closure of NP","volume":"Vol. 199","author":"Wechsung","year":"1985"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190075D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190075D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:45Z","timestamp":1548879945000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190075D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["089054019190075D"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90075-d","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}