{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T04:13:12Z","timestamp":1649218392654},"reference-count":9,"publisher":"Elsevier BV","issue":"5","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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0020-0190(93)90102-f","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"239-241","source":"Crossref","is-referenced-by-count":9,"title":["On random reductions from sparse sets to tally sets"],"prefix":"10.1016","volume":"46","author":[{"given":"Uwe","family":"Sch\u00f6ning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90102-F_BIB1","first-page":"397","article-title":"Reductions that lie","author":"Adleman","year":"1979","journal-title":"Proc. 20th Ann. IEEE Conf. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90102-F_BIB2","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","article-title":"Tally languages and complexity classes","volume":"26","author":"Book","year":"1974","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(93)90102-F_BIB3","series-title":"Tech. Rept. NU-CCS-92-8","article-title":"Sparse reduces conjunctively to tally","author":"Buhrman","year":"1992"},{"key":"10.1016\/0020-0190(93)90102-F_BIB4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/SCT.1991.160268","article-title":"Connections between the complexity of unique satisfiability and the threshold behavior of randomized reductions","author":"Chang","year":"1991","journal-title":"Proc. 6th Ann. IEEE Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0020-0190(93)90102-F_BIB5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(83)90024-8","article-title":"On sparse sets in NP-P","volume":"16","author":"Hartmanis","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90102-F_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(84)90111-7","article-title":"Computation times of NP sets of different densities","volume":"34","author":"Hartmanis","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(93)90102-F_BIB7","series-title":"An Introduction to the Theory of Numbers","author":"Niven","year":"1960"},{"key":"10.1016\/0020-0190(93)90102-F_BIB8","series-title":"Tech. Rept. Dept. of Computer Science","article-title":"Relativized limitations of the left set technique and closure classes of sparse sets","author":"Saluja","year":"1992"},{"key":"10.1016\/0020-0190(93)90102-F_BIB9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(83)90004-X","article-title":"A natural encoding scheme proved probabilistic polynomial complete","volume":"24","author":"Vazirani","year":"1983","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390102F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390102F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:32Z","timestamp":1555129652000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390102F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["002001909390102F"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90102-f","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}