{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:52:24Z","timestamp":1725562344056},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207818"},{"type":"electronic","value":"9783540246350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24635-0_1","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:11:15Z","timestamp":1280747475000},"page":"1-22","source":"Crossref","is-referenced-by-count":7,"title":["Solving Graph Problems by P Systems with Restricted Elementary Active Membranes"],"prefix":"10.1007","author":[{"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Mart\u00edn-Vide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linqiang","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","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.J.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"#cr-split#-1_CR2.1","doi-asserted-by":"crossref","unstructured":"P??un, G.: Computing withMembranes. Journal of Computer and System Sciences??61(1), 108???143 (2000);","DOI":"10.1006\/jcss.1999.1693"},{"key":"#cr-split#-1_CR2.2","unstructured":"TUCS Research Report 208 (1998), http:\/\/www.tucs.fi"},{"issue":"1","key":"1_CR3","first-page":"75","volume":"6","author":"G. P\u0103un","year":"2001","unstructured":"P\u0103un, G.: P Systems with Active Membranes: Attacking NP-Complete Problems. Journal of Automata, Languages and Combinatorics\u00a06(1), 75\u201390 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"1_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing: an Introduction","author":"G. P\u0103un","year":"2002","unstructured":"P\u0103un, G.: Membrane Computing: an Introduction. Springer, Heidelberg (2002)"},{"key":"1_CR5","unstructured":"P\u00e9rez-Jim\u00e9nez, M.J., Romero-Jim\u00e9nez, A., Sancho-Caparrini, F.: Complexity Classes in Cellular Computing with Membranes. In: Cavaliere, M., Mart\u00edn-Vide, C., P\u0103un, G. (eds.) Proceedings of Brainstorming Week on Membrane Computing, Tarragona, Spain, February 2003, pp. 270\u2013278 (2003)"},{"key":"1_CR6","unstructured":"P\u00e9rez-Jim\u00e9nez, M.J., Romero-Jim\u00e9nez, A., Sancho-Caparrini, F.: A Polynomial Complexity Class in P Systems Using Membrane Division. In: Proceedings of the 5th Workshop on Descriptional Complexity of Formal Systems, Budapest, Hungary, July 12-14 (2003)"}],"container-title":["Lecture Notes in Computer Science","Aspects of Molecular Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24635-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:26:27Z","timestamp":1559345187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24635-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207818","9783540246350"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24635-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}