{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:31Z","timestamp":1759637671185,"version":"3.44.0"},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"vor","delay-in-days":5479,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0022-0000(89)90024-x","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"282-298","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":56,"title":["PNP[(log )] and sparse turing-complete sets for NP"],"prefix":"10.1016","volume":"39","author":[{"given":"Jim","family":"Kadin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90024-X_BIB1","article-title":"Bounded queries to SAT and the Boolean hierarchy","author":"Beigel","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90024-X_BIB2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90024-X_BIB3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","article-title":"On the unique satisfiability problem","volume":"55","author":"Blass","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(89)90024-X_BIB4","series-title":"Proceedings, 3rd Structure in Complexity Theory 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\/0022-0000(89)90024-X_BIB5","doi-asserted-by":"crossref","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\/0022-0000(89)90024-X_BIB6","unstructured":"R. Chang, 1988, private communication."},{"key":"10.1016\/0022-0000(89)90024-X_BIB7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0019-9958(86)80012-2","article-title":"On relativized exponential and probabilistic complexity classes","volume":"71","author":"Heller","year":"1986","journal-title":"Inform. and Control"},{"article-title":"Can P and NP manufacture randomness?","year":"1986","author":"Hemachandra","key":"10.1016\/0022-0000(89)90024-X_BIB8"},{"key":"10.1016\/0022-0000(89)90024-X_BIB9","series-title":"Proceedings, 19th ACM Symposium on Theory of Computing","first-page":"110","article-title":"The strong exponential hierarchy collapses","author":"Hemachandra","year":"1987"},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/0022-0000(89)90024-X_BIB10"},{"key":"10.1016\/0022-0000(89)90024-X_BIB11","article-title":"Relativizing relativized computations","author":"Immerman","year":"1988","journal-title":"Theoret. Comput. Sci."},{"article-title":"Deterministic Polynomial Time with O(log n) Queries","year":"1986","author":"Kadin","key":"10.1016\/0022-0000(89)90024-X_BIB12"},{"key":"10.1016\/0022-0000(89)90024-X_BIB13","series-title":"Proceedings, 2nd Structure in Complexity Theory Conference","first-page":"33","article-title":"pNP[logn] and sparse Turing complete sets for NP","author":"Kadin","year":"1987"},{"key":"10.1016\/0022-0000(89)90024-X_BIB14","doi-asserted-by":"crossref","DOI":"10.1137\/0217080","article-title":"The polynomial hierarchy collapses if the Boolean hierarchy collapses","volume":"17","author":"Kadin","year":"1988","journal-title":"SIAM J Comput."},{"key":"10.1016\/0022-0000(89)90024-X_BIB15","first-page":"191","article-title":"Turing machines that take advice","volume":"28","author":"Karp","year":"1982","journal-title":"Enseign. Math."},{"key":"10.1016\/0022-0000(89)90024-X_BIB16","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."},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90024-X_BIB17","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\/0022-0000(89)90024-X_BIB18","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0022-0000(82)90050-2","article-title":"A note on sparse oracles for NP","volume":"24","author":"Long","year":"1982","journal-title":"J. Comput. System Sci."},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90024-X_BIB19","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90024-X_BIB20","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/62.322435","article-title":"On the complexity of unique solutions","volume":"31","author":"Papadimitriou","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90024-X_BIB21","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\/0022-0000(89)90024-X_BIB22","series-title":"Sixth GI Conference on Theoretical Computer Science","first-page":"269","article-title":"Two remarks on the power of counting","volume":"Vol. 145","author":"Papadimitriou","year":"1983"},{"article-title":"The Complexity of Decision Problems in Automata Theory and Logic","year":"1974","author":"Stockmeyer","key":"10.1016\/0022-0000(89)90024-X_BIB23"},{"key":"10.1016\/0022-0000(89)90024-X_BIB24","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."},{"key":"10.1016\/0022-0000(89)90024-X_BIB25","series-title":"Proceedings, 13th International Colloquium on Automata, Languages, and Programming (ICALP)","first-page":"434","article-title":"More complicated questions about maxima and minima, and some closures of NP","volume":"Vol. 226","author":"Wagner","year":"1986"},{"article-title":"Bounded Query Classes","year":"1987","author":"Wagner","key":"10.1016\/0022-0000(89)90024-X_BIB26"},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90024-X_BIB27","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0022-0000(85)90040-6","article-title":"Relativized circuit complexity","volume":"31","author":"Wilson","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90024-X_BIB28","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","article-title":"Some consequences of non-uniform conditions on uniform classes","volume":"26","author":"Yap","year":"1983","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008990024X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008990024X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:10:57Z","timestamp":1757095857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200008990024X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["002200008990024X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90024-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1989,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"PNP[O(log n)] and sparse turing-complete sets for NP","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(89)90024-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}