{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:20:21Z","timestamp":1648725621836},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"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":10821,"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":[[1983,12]]},"DOI":"10.1016\/0022-0000(83)90048-x","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"378-388","source":"Crossref","is-referenced-by-count":8,"title":["A normal form for arithmetical representation of N P-sets"],"prefix":"10.1016","volume":"27","author":[{"given":"Bernard R.","family":"Hodgson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clement F.","family":"Kent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90048-X_BIB1","article-title":"Number Theoretic Aspects of Computational Complexity","author":"Adleman","year":"1976"},{"key":"10.1016\/0022-0000(83)90048-X_BIB2","series-title":"Proceedings, 16th Annual Symposium on Foundations of Computer Science","first-page":"169","article-title":"Computational complexity of decision procedures for polynomials","author":"Adleman","year":"1975"},{"key":"10.1016\/0022-0000(83)90048-X_BIB3","series-title":"Proceedings, 17th Annual Symposium on Foundations of Computer Science","first-page":"81","article-title":"Diophantine complexity","author":"Adleman","year":"1976"},{"key":"10.1016\/0022-0000(83)90048-X_BIB4","series-title":"Proceedings, 3rd Annual 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(83)90048-X_BIB5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.2307\/2266325","article-title":"Arithmetical problems and recursively enumerable predicates","volume":"18","author":"Davis","year":"1953","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(83)90048-X_BIB6","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"key":"10.1016\/0022-0000(83)90048-X_BIB7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.2307\/2318447","article-title":"Hilbert's tenth problem is unsolvable","volume":"80","author":"Davis","year":"1973","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0022-0000(83)90048-X_BIB8","first-page":"323","article-title":"Hilbert's Tenth Problems. Diophantine equations. Positive aspects of a negative solution","volume":"28","author":"Davis","year":"1976"},{"key":"10.1016\/0022-0000(83)90048-X_BIB9","series-title":"Mathematical Foundations of Computer Science 1981","first-page":"46","article-title":"A survey of some results on computational complexity in weak theories of arithmetic","author":"Joseph","year":"1981"},{"key":"10.1016\/0022-0000(83)90048-X_BIB10","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(83)90048-X_BIB11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(82)90076-7","article-title":"An arithmetical characterization of N P","volume":"21","author":"Kent","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90048-X_BIB12","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0022-0000(78)90044-2","article-title":"N P-complete decision problems for binary quadratics","volume":"16","author":"Manders","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90048-X_BIB13","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1007\/BF01693980","article-title":"A new proof of the theorem on exponential Diophantine representation of enumerable sets","volume":"14","author":"Matijasevi\u010d","year":"1980","journal-title":"J. Soviet Math."},{"key":"10.1016\/0022-0000(83)90048-X_BIB14","doi-asserted-by":"crossref","first-page":"162","DOI":"10.2307\/2268755","article-title":"Arithmetical representation of recursively enumerable sets","volume":"21","author":"Robinson","year":"1956","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(83)90048-X_BIB15","first-page":"162","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90048-X_BIB16","first-page":"23","article-title":"Complete sets and the polynomial-time hierarchy","volume":"2","author":"Wrathall","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008390048X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008390048X?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:51:19Z","timestamp":1550325079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200008390048X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["002200008390048X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90048-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}