{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:52:44Z","timestamp":1775281964965,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,10,1]],"date-time":"1983-10-01T00:00:00Z","timestamp":433814400000},"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":10882,"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":[[1983,10]]},"DOI":"10.1016\/0304-3975(83)90020-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"287-300","source":"Crossref","is-referenced-by-count":170,"title":["Some consequences of non-uniform conditions on uniform classes"],"prefix":"10.1016","volume":"26","author":[{"given":"Chee K.","family":"Yap","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90020-8_BIB1","first-page":"151","article-title":"Reducibility, randomness and intractibility","author":"Adleman","year":"1977","journal-title":"Proc. 9th ACM STOC"},{"key":"10.1016\/0304-3975(83)90020-8_BIB2","series-title":"5th Internat. Coll. on Automata, Languages and Programming","article-title":"Relationship between density and deterministic complexity of NP-complete languages","volume":"62","author":"Berman","year":"1978"},{"issue":"2","key":"10.1016\/0304-3975(83)90020-8_BIB3","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\/0304-3975(83)90020-8_BIB4","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0208034","article-title":"A note on sparse complete sets","volume":"8","author":"Fortune","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90020-8_BIB5","first-page":"348","article-title":"On similarity and duality of computation","author":"Hong","year":"1980","journal-title":"21st Symp. FOCS"},{"key":"10.1016\/0304-3975(83)90020-8_BIB6","first-page":"74","article-title":"Upper and lower bounds for first order expressibility","author":"Immerman","year":"1980","journal-title":"21st Symp. FOCS"},{"key":"10.1016\/0304-3975(83)90020-8_BIB7","article-title":"Type reduction and program verification","author":"Jefferson","year":"1980","journal-title":"CMU Ph.D. Thesis"},{"key":"10.1016\/0304-3975(83)90020-8_BIB8","first-page":"302","article-title":"Some connections between non-uniform and uniform complexity classes","author":"Karp","year":"1980","journal-title":"Proc. 12th Ann. ACM STOC"},{"key":"10.1016\/0304-3975(83)90020-8_BIB9","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(83)90020-8_BIB10","article-title":"A note on co-sparse polynomial time turing complete sets for NP","author":"Long","year":"1980","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(83)90020-8_BIB11","first-page":"54","article-title":"Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis","author":"Manhaney","year":"1980","journal-title":"Proc. 21st Ann. Symp. FOCS"},{"key":"10.1016\/0304-3975(83)90020-8_BIB12","article-title":"With what frequency are apparently intractable problems difficult","author":"Meyer","year":"1979","journal-title":"MIT Tech. Memo. 126"},{"key":"10.1016\/0304-3975(83)90020-8_BIB13","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\/0304-3975(83)90020-8_BIB14","unstructured":"E. Ukkonen, Two results on polynomial time Turing reductions to sparse sets, SIAM J. Comput., to appear."},{"key":"10.1016\/0304-3975(83)90020-8_BIB15","series-title":"Tech. Rept. 152\/81","article-title":"On certain polynomial-time truth table reducibilities of complete sets to sparse sets","author":"Yesha","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900208?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900208?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:28:48Z","timestamp":1555126128000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["0304397583900208"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90020-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}