{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:49Z","timestamp":1759638889189},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"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":[[1993,7]]},"DOI":"10.1016\/0304-3975(93)90120-i","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"277-290","source":"Crossref","is-referenced-by-count":9,"title":["Hard promise problems and nonuniform complexity"],"prefix":"10.1016","volume":"115","author":[{"given":"Luc","family":"Longpr\u00e9","sequence":"first","affiliation":[]},{"given":"Alan L.","family":"Selman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90120-I_BIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","article-title":"On hiding information from an oracle","volume":"39","author":"Abadi","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90120-I_BIB2","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/5925.5937","article-title":"The polynomial-time hierarchy and sparse oracles","volume":"33","author":"Balc\u00e1zar","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(93)90120-I_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\/0304-3975(93)90120-I_BIB4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0019-9958(84)80056-X","article-title":"The complexity of promise problems with applications to public-key cryptography","volume":"61","author":"Even","year":"1984","journal-title":"Inform. And Control"},{"key":"10.1016\/0304-3975(93)90120-I_BIB5","series-title":"Proc. 8th Colloq. on Automata, Languages, and Programming","first-page":"195","article-title":"Cryptocomplexity and NP-completeness","volume":"Vol. 85","author":"Even","year":"1980"},{"key":"10.1016\/0304-3975(93)90120-I_BIB6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(93)90120-I_BIB7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","article-title":"Complexity measures for public-key cryptosystems","volume":"17","author":"Grollmann","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90120-I_BIB8","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980","journal-title":"Proc. 12th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(93)90120-I_BIB9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(83)90013-2","article-title":"On self-reducibility and weak P-selectivity","volume":"26","author":"Ko","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90120-I_BIB10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0214003","article-title":"On circuit-size and the low hierarchy in NP","volume":"14","author":"Ko","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90120-I_BIB11","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(93)90120-I_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(82)90085-8","article-title":"Strong nondeterministic polynomial-time reducibilities","volume":"21","author":"Long","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90120-I_BIB13","series-title":"Technical Report MIT\/LCS\/TM-126","article-title":"With what frequency are apparently intractable problems difficult?","author":"Meyer","year":"1979"},{"key":"10.1016\/0304-3975(93)90120-I_BIB14","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\/0304-3975(93)90120-I_BIB15","first-page":"77","article-title":"Generalized polynomial reductions, degrees, and NP-completeness","volume":"7","author":"Sch\u00f6ning","year":"1984","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(93)90120-I_BIB16","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/malq.19710170139","article-title":"Arithmetical reducibilities I","volume":"17","author":"Selman","year":"1971","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(93)90120-I_BIB17","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"},{"key":"10.1016\/0304-3975(93)90120-I_BIB18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(82)90039-1","article-title":"Reductions on NP and P-selective sets","volume":"19","author":"Selman","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90120-I_BIB19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(88)90030-2","article-title":"Promise problems complete for complexity classes","volume":"78","author":"Selman","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90120-I_BIB20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390120I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390120I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:23:31Z","timestamp":1555115011000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390120I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["030439759390120I"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90120-i","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}