{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:02:25Z","timestamp":1648868545717},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0304-3975(89)90125-4","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"123-134","source":"Crossref","is-referenced-by-count":3,"title":["On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas"],"prefix":"10.1016","volume":"68","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Biswas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90125-4_BIB1","article-title":"Kernel constructible languages","author":"Arvind","year":"1983","journal-title":"Proc. 3rd FSTTCS Conference"},{"key":"10.1016\/0304-3975(89)90125-4_BIB2","series-title":"Proc. 7th FSTTCS Conference","first-page":"456","article-title":"On certain bandwidth restricted versions of the satisfiability problem","volume":"287","author":"Arvind","year":"1987"},{"key":"10.1016\/0304-3975(89)90125-4_BIB3","series-title":"Proc. Symposium \u201cRekursive Kombinatorik\u201d","first-page":"333","article-title":"Spectralproblems and completeness of logical decision problems","volume":"171","author":"Borger","year":"1983"},{"key":"10.1016\/0304-3975(89)90125-4_BIB4","series-title":"Computers and Intractibility: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(89)90125-4_BIB5","article-title":"With what frequency are apparently intractable problems difficult?","author":"Meyer","year":"1979","journal-title":"Technical Report"},{"key":"10.1016\/0304-3975(89)90125-4_BIB6","first-page":"207","article-title":"Bandwidth constrained NP-complete problems","author":"Monien","year":"1981","journal-title":"Proc. 13th Annual ACMSTOC"},{"key":"10.1016\/0304-3975(89)90125-4_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BFb0120931","article-title":"On self-transformable combinatorial problems","volume":"14","author":"Schnorr","year":"1979","journal-title":"Math. Program. Study"},{"key":"10.1016\/0304-3975(89)90125-4_BIB8","author":"Selman","year":"1986","journal-title":"Natural self-reducible sets"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901254?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901254?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T22:20:29Z","timestamp":1555194029000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0304397589901254"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90125-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}