{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:19:54Z","timestamp":1648880394697},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,6,1]],"date-time":"1978-06-01T00:00:00Z","timestamp":265507200000},"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":12830,"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":[[1978,6]]},"DOI":"10.1016\/0022-0000(78)90027-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"418-422","source":"Crossref","is-referenced-by-count":2,"title":["On polynomial time isomorphisms of some new complete sets"],"prefix":"10.1016","volume":"16","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Berman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(78)90027-2_BIB1","series-title":"Proceedings of IEEE 17th Annual Symposium on Foundations of Computer Science","first-page":"98","article-title":"Alternations","author":"Chandra","year":"1976"},{"key":"10.1016\/0022-0000(78)90027-2_BIB2","series-title":"Proceedings Third Annual 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(78)90027-2_BIB3","series-title":"Proceedings of Theoretical Computer Science 3rd GI Conference","first-page":"1","article-title":"On polynomial time isomorphisms of complete sets","volume":"Vol. 48","author":"Berman","year":"1977"},{"key":"10.1016\/0022-0000(78)90027-2_BIB4","series-title":"Proceedings Eighth Annual Symposium on Theory of Computing","first-page":"50","article-title":"Exponential tape complete problems for Petri nets and commutative semigroups; preliminary report","author":"Cordova","year":"1976"},{"key":"10.1016\/0022-0000(78)90027-2_BIB5_1","series-title":"Proceedings Eighth Annual Symposium on Theory of Computing","first-page":"30","article-title":"On isomorphisms and density of NP and other complete sets","author":"Hartmanis","year":"1976"},{"key":"10.1016\/0022-0000(78)90027-2_BIB5_2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","volume":"6","author":"Hartmanis","year":"1977","journal-title":"SIAM J. of Computing"},{"key":"10.1016\/0022-0000(78)90027-2_BIB6","first-page":"1","article-title":"On the structure of feasible computations","volume":"Vol. 14","author":"Hartmanis","year":"1976"},{"key":"10.1016\/0022-0000(78)90027-2_BIB7","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibilities among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(78)90027-2_BIB8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(78)90027-2_BIB9","series-title":"Proceedings Eighth Annual ACM Symposium on Theory of Computing","first-page":"23","article-title":"NP-complete decision problems for quadratic polynomials","author":"Manders","year":"1976"},{"key":"10.1016\/0022-0000(78)90027-2_BIB10","series-title":"IEEE 13th Annual Symposium on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/0022-0000(78)90027-2_BIB11","series-title":"IEEE 17th Symposium on Foundations of Computer Science","first-page":"264","article-title":"Some polynomial and integer divisibility problems are NP-hard","author":"Plaisted","year":"1976"},{"key":"10.1016\/0022-0000(78)90027-2_BIB12","series-title":"Proceedings Eighth Annual ACM Symposium on Theory of Computing","first-page":"41","article-title":"Complexity of decision problems based on finite two-person perfect-information games","author":"Schaefer","year":"1976"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900272?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900272?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:28:03Z","timestamp":1550323683000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000078900272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,6]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,6]]}},"alternative-id":["0022000078900272"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(78)90027-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1978,6]]}}}