{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:34:46Z","timestamp":1649136886833},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"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":6529,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0168-0072(94)00061-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T22:40:50Z","timestamp":1052779250000},"page":"137-152","source":"Crossref","is-referenced-by-count":0,"title":["On NP-completeness in Linear Logic"],"prefix":"10.1016","volume":"75","author":[{"given":"Alexey P.","family":"Kopylov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(94)00061-7_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0168-0072(94)00061-7_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear Logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(94)00061-7_BIB3","article-title":"The multiplicative fragment of Linear Logic is NP-complete","author":"Kanovich","year":"1991"},{"key":"10.1016\/0168-0072(94)00061-7_BIB4","series-title":"Proc. 7th Ann. IEEE Symp. on Logic in Computer Science","first-page":"200","article-title":"Horn programming in Linear Logic is NP-complete","author":"Kanovich","year":"1992"},{"key":"10.1016\/0168-0072(94)00061-7_BIB5","series-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science","first-page":"662","article-title":"Decision problems for propositional linear logic","author":"Lincoln","year":"1990"},{"key":"10.1016\/0168-0072(94)00061-7_BIB6","series-title":"Constant multiplicative logic is NP-complete","author":"Lincoln","year":"1992"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007294000617?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007294000617?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T13:27:55Z","timestamp":1556198875000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007294000617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["0168007294000617"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(94)00061-7","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}