{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:27:51Z","timestamp":1720625271381},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":1945,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1016\/j.entcs.2008.03.066","type":"journal-article","created":{"date-parts":[[2008,4,9]],"date-time":"2008-04-09T10:12:28Z","timestamp":1207735948000},"page":"67-87","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Soft Linear Logic and Polynomial Complexity Classes"],"prefix":"10.1016","volume":"205","author":[{"given":"Marco","family":"Gaboardi","sequence":"first","affiliation":[]},{"given":"Jean-Yves","family":"Marion","sequence":"additional","affiliation":[]},{"given":"Simona","family":"Ronchi Della Rocca","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2008.03.066_bib001","series-title":"Proceedings of the Nineteenth Annual IEEE Symposium on Logic in Computer Science","first-page":"266","article-title":"Light types for polynomial time computation in lambda-calculus","author":"Baillot","year":"2004"},{"issue":"1","key":"10.1016\/j.entcs.2008.03.066_bib002","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.entcs.2008.03.066_bib003","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":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2008.03.066_bib004","doi-asserted-by":"crossref","unstructured":"M. Gaboardi, J.-Y. Marion, and S. Ronchi Della Rocca. A logical account of PSPACE. In 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL 2008, San Francisco, January 10\u201312, 2008, Proceedings, 2008. to appear","DOI":"10.1145\/1328438.1328456"},{"key":"10.1016\/j.entcs.2008.03.066_bib005","series-title":"Proceedings of the 21st International Workshop on Computer Science Logic","first-page":"253","article-title":"A soft type assignment system for \u03bb-calculus","volume":"volume 4646","author":"Gaboardi","year":"2007"},{"key":"10.1016\/j.entcs.2008.03.066_bib006","doi-asserted-by":"crossref","unstructured":"J.-L. Krivine. A call-by-name lambda calculus machine. Higher Order and Symbolic Computation, 2007. To appear","DOI":"10.1007\/s10990-007-9018-9"},{"issue":"1-2","key":"10.1016\/j.entcs.2008.03.066_bib007","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.tcs.2003.10.018","article-title":"Soft linear logic and polynomial time","volume":"318","author":"Lafont","year":"2004","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2008.03.066_bib008","series-title":"Proceedings of the 8th International Workshop on Computer Science Logic","first-page":"486","article-title":"Ramified recurrence and computational complexity II: Substitution and poly-space","volume":"volume 933","author":"Leivant","year":"1994"},{"key":"10.1016\/j.entcs.2008.03.066_bib009","series-title":"TAPSOFT'97: Theory and Practice of Software Development","first-page":"369","article-title":"Predicative functional recurrence and poly-space","volume":"volume 1214","author":"Leivant","year":"1997"},{"key":"10.1016\/j.entcs.2008.03.066_bib010","series-title":"Proceedings of the 6th International Conference on Typed Lambda-Calculi and Applications","first-page":"241","article-title":"Nondeterministic light logics and NP-time","volume":"volume 2701","author":"Maurel","year":"2003"},{"key":"10.1016\/j.entcs.2008.03.066_bib011","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationship between nondeterministic and deterministic tape classes","volume":"4","author":"Savitch","year":"1970","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066108001710?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066108001710?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T21:49:16Z","timestamp":1557438556000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066108001710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":11,"alternative-id":["S1571066108001710"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2008.03.066","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}