{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:06:43Z","timestamp":1649041603601},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":7716,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0022-0000(92)90015-b","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"500-516","source":"Crossref","is-referenced-by-count":7,"title":["On polynomial time one-truth-table reducibility to a sparse set"],"prefix":"10.1016","volume":"44","author":[{"given":"Osamu","family":"Watanabe","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90015-B_BIB1","series-title":"Proceedings, 19th Annual Symposium on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0022-0000(92)90015-B_BIB2","series-title":"Proceedings, 1sr Structure in Complexity Theory Conference","first-page":"1","article-title":"The complexity of sparse sets in P","volume":"Vol. 223","author":"Allender","year":"1986"},{"key":"10.1016\/0022-0000(92)90015-B_BIB3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97062-7","article-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0022-0000(92)90015-B_BIB4","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1137\/0217056","article-title":"On sets truth-table reducible to sparse sets","volume":"17","author":"Book","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90015-B_BIB5","series-title":"Proceedings, 8th International Colloquium on Automata, Languages and Programming","first-page":"195","article-title":"Cryptocomplexity and NP-completeness","volume":"Vol. 223","author":"Even","year":"1980"},{"key":"10.1016\/0022-0000(92)90015-B_BIB6","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\/0022-0000(92)90015-B_BIB7","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(92)90015-B_BIB8","doi-asserted-by":"crossref","unstructured":"J. Grollmann, and A. Selman, Complexity measures for public-key cryptosystems, in \u201cProceedings, 25th IEEE Symposium, Foundations of Computer Science,\u201d pp. 495\u2013503, IEEE, New York, 184; the final version","DOI":"10.1109\/SFCS.1984.715952"},{"key":"10.1016\/0022-0000(92)90015-B_BIB9","first-page":"309","article-title":"Complexity measures for public-key cryptosystems SIAM","volume":"17","author":"Grollmann","year":"1988","journal-title":"J. Comput."},{"key":"10.1016\/0022-0000(92)90015-B_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90085-4","article-title":"On some natural complete operators","volume":"37","author":"Ko","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90015-B_BIB11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(86)90152-0","article-title":"A note on one-way functions and polynomial time isomorphisms","volume":"47","author":"Ko","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90015-B_BIB12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0022-0000(88)90007-4","article-title":"Collapsing degrees","volume":"37","author":"Kurtz","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90015-B_BIB13","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(92)90015-B_BIB14","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete ses for NP: Solution of a conjecture of Berman and Harmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90015-B_BIB15","series-title":"Studies in Complexity Theory","first-page":"63","article-title":"Sparse sets and reducibilities","author":"Mahaney","year":"1986"},{"key":"10.1016\/0022-0000(92)90015-B_BIB16","series-title":"Proceedings, 22nd ACM Symposium on Theory of Computing","first-page":"457","article-title":"On polynomial bounded truth-table reducibility of NP sets to sparse sets","author":"Ogiwara","year":"1990"},{"key":"10.1016\/0022-0000(92)90015-B_BIB17","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(92)90015-B_BIB18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01704904","article-title":"Complete sets and closeness to complexity classes","volume":"19","author":"Sch\u00f6ning","year":"1986","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(92)90015-B_BIB19","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/0217062","article-title":"Natural self-reducible sets","volume":"17","author":"Selman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90015-B_BIB20","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0212038","article-title":"Two results on polynomial time Turing reductions to sparse sets","volume":"12","author":"Ukkonen","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90015-B_BIB21","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"Relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(92)90015-B_BIB22","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."},{"key":"10.1016\/0022-0000(92)90015-B_BIB23","series-title":"Proceedings, 2nd Structure in Complexity Theory Conference","first-page":"138","article-title":"Polynomial tie reducibility to a set of small density","author":"Watanabe","year":"1987"},{"key":"10.1016\/0022-0000(92)90015-B_BIB24","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0020-0190(88)90071-3","article-title":"On hardness of one-way functions","volume":"27","author":"Watanabe","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(92)90015-B_BIB25","unstructured":"O. Watanabe, On the intractability of the class UP, Math. Systems Theory, to appear."},{"key":"10.1016\/0022-0000(92)90015-B_BIB26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1976","journal-title":"Theoret. Compui. Sci."},{"key":"10.1016\/0022-0000(92)90015-B_BIB27","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0212027","article-title":"On certain polynomial-time truth-table reductions to sparse sets","volume":"12","author":"Yesha","year":"1983","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290015B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290015B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:57:05Z","timestamp":1550307425000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290015B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["002200009290015B"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90015-b","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}