{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:15Z","timestamp":1725664695793},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630456"},{"type":"electronic","value":"9783540690658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:01:02Z","timestamp":1330297262000},"page":"78-87","source":"Crossref","is-referenced-by-count":0,"title":["The concurrency complexity for the Horn fragment of linear logic"],"prefix":"10.1007","author":[{"given":"Sergey M.","family":"Dudakov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0168-0072(94)90006-X","volume":"67","author":"D.A. Archangelsky","year":"1994","unstructured":"Archangelsky D.A., Taitslin M.A., Linear Logic With Fixed Resources. Annals of Pure and Applied Logic, v. 67 (1994),pp. 3\u201328.","journal-title":"Annals of Pure and Applied Logic"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-58140-5_3","volume":"N 813","author":"D.A. Archangelsky","year":"1994","unstructured":"Archangelsky D.A., Dekhtyar M.I., Kruglov E., Musikaev I.Kh., and Taitslin M.A. Concurrency problem for Horn fragment of Girard's Linear Logic. Logical Foundation of Computer Science, St.Petersburg'94, Lecture Notes in Computer Science, N 813, 1994, pp. 18\u201322.","journal-title":"Logical Foundation of Computer Science, St.Petersburg'94, Lecture Notes in Computer Science"},{"key":"9_CR3","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H.Freeman and Company, San Francisco, 1979."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Kanovich M.I. Horn Programming in Linear Logic is NP-complete. Proc.7-th Annual IEEE Symposium on Logic in Computer Science, 1992, pp. 200\u2013210.","DOI":"10.1109\/LICS.1992.185533"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Lincoln P., Mitchell J., Scerdov A., and Shankar N. Decision Problems for Propositional Linear Logic. Proc.31-th IEEE Symposium on Foundation of Computer Science, 1990, pp. 662\u2013671.","DOI":"10.1109\/FSCS.1990.89588"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Meyer A.R., Stockmeyer L. J. The equivalence problem for regular expressions with squaring requires exponential time. Proc.13th Ann. Symp. on Switching and Automata Theory, 1972, pp. 125\u2013129.","DOI":"10.1109\/SWAT.1972.29"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:20Z","timestamp":1605647720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}