{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:36:07Z","timestamp":1757615767673,"version":"3.44.0"},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,5,19]],"date-time":"2004-05-19T00:00:00Z","timestamp":1084924800000},"content-version":"vor","delay-in-days":6562,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1016\/0020-0255(86)90029-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:28:37Z","timestamp":1056979717000},"page":"299-301","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A comment on \u201c\u2018NP = P?\u2019 and restricted partitions\u201d"],"prefix":"10.1016","volume":"38","author":[{"given":"He","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(86)90029-0_BIB1","doi-asserted-by":"crossref","unstructured":"S. A. Cook, The complexity of theorem proving procedures, in Proceedings of the Third Annual ACM Symposium on the Theory of Computing, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/0020-0255(86)90029-0_BIB2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0020-0255(84)90036-7","article-title":"\u201cNP = P?\u201d and restricted partitions","volume":"32","author":"Zhang","year":"1984","journal-title":"Inform. Sci."},{"key":"10.1016\/0020-0255(86)90029-0_BIB3","first-page":"69","article-title":"The Art and Theory of Dynamic Programming","author":"Dreyfus","year":"1977"},{"key":"10.1016\/0020-0255(86)90029-0_BIB4","first-page":"198","article-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawer","year":"1976"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025586900290?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025586900290?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:59:10Z","timestamp":1757084350000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025586900290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["0020025586900290"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(86)90029-0","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[1986,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A comment on \u201c\u2018NP = P?\u2019 and restricted partitions\u201d","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0255(86)90029-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1986 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}