{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T01:44:32Z","timestamp":1648863872166},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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":8751,"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":[[1989,8]]},"DOI":"10.1016\/0022-0000(89)90017-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"2-20","source":"Crossref","is-referenced-by-count":8,"title":["Strong nondeterministic turing reduction\u2014A technique for proving intractability"],"prefix":"10.1016","volume":"39","author":[{"given":"Moon Jung","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Ravikumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90017-2_BIB1","doi-asserted-by":"crossref","unstructured":"L. Adleman and K. Manders Reductions that lie, in \u201cProceedings, 20th IEEE Symposium on Foundations of Computer Science,\u201d 397\u2013410 .","DOI":"10.1109\/SFCS.1979.35"},{"key":"10.1016\/0022-0000(89)90017-2_BIB2","doi-asserted-by":"crossref","unstructured":"M. J. Chung and B. Ravikumar, On the size of test sets for sorting and related networks, Discrete Math., in press.","DOI":"10.1016\/0012-365X(90)90173-F"},{"key":"10.1016\/0022-0000(89)90017-2_BIB3","series-title":"Proceedings, of 3rd ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(89)90017-2_BIB4","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(89)90017-2_BIB5","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(89)90017-2_BIB6","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0196-6774(82)90011-6","article-title":"NP-completeness column","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(89)90017-2_BIB7","author":"Knuth","year":"1973"},{"key":"10.1016\/0022-0000(89)90017-2_BIB8","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)90017-2_BIB9","article-title":"Introduction to Coding Theory","volume":"Vol. 86","author":"van Lint","year":"1982"},{"key":"10.1016\/0022-0000(89)90017-2_BIB10","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."},{"issue":"No. 4","key":"10.1016\/0022-0000(89)90017-2_BIB11","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0207035","article-title":"Polynomial time enumeration reducibility","volume":"7","author":"Selman","year":"1978","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:0022000089900172?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900172?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:55:09Z","timestamp":1550325309000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0022000089900172"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90017-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}