{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:52Z","timestamp":1725663172967},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540186250"},{"type":"electronic","value":"9783540480334"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18625-5_68","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:40:53Z","timestamp":1330180853000},"page":"456-469","source":"Crossref","is-referenced-by-count":0,"title":["On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"unstructured":"Meyer, A.R. and Paterson, M.S., With What Frequency are Apparently Intractable Problems Difficult? Technical Report, MIT\/LCS\/TM-126, 1979.","key":"32_CR1"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BFb0120931","volume":"14","author":"C. P. Schnorr","year":"1981","unstructured":"Schnorr, C.P., On Self-transformable Combinatorial Problems, Math. Programming Study, Vol. 14, pp. 225\u2013243, 1981.","journal-title":"Math. Programming Study"},{"unstructured":"Selman, A.L., Natural Self-reducible Sets, manuscript, July 1986.","key":"32_CR3"},{"doi-asserted-by":"crossref","unstructured":"Monien, B. and Sudborough, I.H., Bandwidth Constrained NP-Complete Problems, Proc. 13-th Annual ACM STOC, pp. 207\u2013217, 1981.","key":"32_CR4","DOI":"10.1145\/800076.802474"},{"unstructured":"Arvind, V. and Biswas, S., Kernel Constructible Languages, Proceedings of the Third FSTTCS Conference, 1983.","key":"32_CR5"},{"key":"32_CR6","first-page":"333","volume":"171","author":"E. B\u00f6rger","year":"1983","unstructured":"B\u00f6rger, E., Spektralproblems and Completeness of Logical Decision Problems, Proc. of Symposium \"Rekursive Kombinatorik\", Vol. 171, Lecture Notes in Computer Science, Springer-Verlag, pp. 333\u2013353, 1983.","journal-title":"Proc. of Symposium \"Rekursive Kombinatorik\""},{"unstructured":"Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, H. Freeman, 1979.","key":"32_CR7"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18625-5_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:15:52Z","timestamp":1619543752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18625-5_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540186250","9783540480334"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-18625-5_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}