{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T17:55:49Z","timestamp":1719942949667},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1016\/0020-0190(95)00017-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"169-174","source":"Crossref","is-referenced-by-count":13,"title":["Knapsack problems for NL"],"prefix":"10.1016","volume":"54","author":[{"given":"Birgit","family":"Jenner","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00017-7_BIB1","article-title":"Structural Complexity I","volume":"11","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0020-0190(95)00017-7_BIB2","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","article-title":"Bounded-depth polynomial size branching programs recognize exactly those languages in NC1","volume":"38","author":"Barrington","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(95)00017-7_BIB3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0020-0190(88)90057-9","article-title":"On a complexity hierarchy between L and NL","volume":"29","author":"Cho","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00017-7_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(95)00017-7_BIB5","article-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(95)00017-7_BIB6","article-title":"Concatenation versus addition in knapsack problems","author":"Jenner","year":"1993"},{"key":"10.1016\/0020-0190(95)00017-7_BIB7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(95)00017-7_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","article-title":"New problems complete for nondeterministic log space","volume":"10","author":"Jones","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0020-0190(95)00017-7_BIB9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0890-5401(89)90008-4","article-title":"The iterated mod problem is P-complete","volume":"80","author":"Karloff","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(95)00017-7_BIB10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(82)90058-5","article-title":"Symmetric space-bounded computation","volume":"19","author":"Lewis","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(95)00017-7_BIB11","series-title":"Formal Language Theory","article-title":"Formal language theory","author":"Monien","year":"1980"},{"key":"10.1016\/0020-0190(95)00017-7_BIB12","series-title":"Combinatorial Optimization","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0020-0190(95)00017-7_BIB13","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"On tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(95)00017-7_BIB14","series-title":"Computational Complexity","author":"Wagner","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095000177?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095000177?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:58:41Z","timestamp":1555297121000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095000177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["0020019095000177"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00017-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}