{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:29:40Z","timestamp":1759336180442},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2015,6,5]],"date-time":"2015-06-05T00:00:00Z","timestamp":1433462400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00500-015-1732-3","type":"journal-article","created":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T11:02:20Z","timestamp":1433415740000},"page":"3043-3053","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Computational efficiency and universality of timed P systems with membrane creation"],"prefix":"10.1007","volume":"19","author":[{"given":"Bosheng","family":"Song","sequence":"first","affiliation":[]},{"given":"Mario J.","family":"P\u00e9rez-Jim\u00e9nez","sequence":"additional","affiliation":[]},{"given":"Linqiang","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,5]]},"reference":[{"key":"1732_CR1","doi-asserted-by":"crossref","unstructured":"Cavaliere M, Sburlan D (2005) Time-independent P systems. In: Mauri G, P\u0103un Gh, P\u00e9rez-Jim\u00e9nez MJ, Rozenberg G, Salomaa A (eds), Membrane Computing. Lecture notes in computer science, vol 3365, pp 239\u2013258","DOI":"10.1007\/978-3-540-31837-8_14"},{"key":"1732_CR2","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DJ (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H Freeman, New York"},{"issue":"5","key":"1732_CR3","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1142\/S0129054113500202","volume":"24","author":"M Gheorghe","year":"2013","unstructured":"Gheorghe M, P\u0103un G, P\u00e9rez-Jim\u00e9nez MJ (2013) Research frontiers of membrane computing: open problems and research topics. Section 12 Cavaliere M, time-free solutions to hard computational problems. Int J Found Comput Sci 24(5):579\u2013582","journal-title":"Int J Found Comput Sci"},{"key":"1732_CR4","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez-Naranjo MA, P\u00e9rez-Jim\u00e9nez MJ, Romero-Campero FJ (2005) A linear solution of subset sum problem by using membrane creation. In: Mira J, \u00c1lvarez JR (eds), Mechanisms, symbols, and models underlying cognition. Lecture notes in computer science, vol 3561, pp 258\u2013267","DOI":"10.1007\/11499220_27"},{"key":"1732_CR5","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez-Naranjo MA, P\u00e9rez-Jim\u00e9nez MJ, Romero-Campero FJ (2006) A linear time solution for QSAT with membrane creation. In: Freund R, P\u0103un Gh, Rozenberg G, Salomaa A (eds), Membrane computing. Lecture notes in computer science, vol 3850, pp 241\u2013252","DOI":"10.1007\/11603047_17"},{"key":"1732_CR6","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.tcs.2006.10.013","volume":"371","author":"MA Guti\u00e9rrez-Naranjo","year":"2007","unstructured":"Guti\u00e9rrez-Naranjo MA, P\u00e9rez-Jim\u00e9nez MJ, Romero-Campero FJ (2007) A uniform solution to SAT using membrane creation. Theor Comput Sci 371:54\u201361","journal-title":"Theor Comput Sci"},{"key":"1732_CR7","doi-asserted-by":"crossref","unstructured":"Mutyam M, Krithivasan K (2001) P systems with membrane creation: universality and efficiency. In: Margenstern M, Rogozhin Y (eds), Machines, computations, and universality. Lecture notes in computer science, vol 2055, pp 276\u2013287","DOI":"10.1007\/3-540-45132-3_19"},{"key":"1732_CR8","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1016\/j.tcs.2009.11.010","volume":"411","author":"L Pan","year":"2010","unstructured":"Pan L, P\u0103un G (2010) Spiking neural P systems: an improved normal form. Theor Comput Sci 411:906\u2013918","journal-title":"Theor Comput Sci"},{"key":"1732_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/NECO_a_00058","volume":"23","author":"L Pan","year":"2011","unstructured":"Pan L, Zeng X, Zhang X (2011) Time-free spiking neural P systems. Neural Comput 23:1\u201323","journal-title":"Neural Comput"},{"issue":"1","key":"1732_CR10","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G P\u0103un","year":"2000","unstructured":"P\u0103un G (2000) Computing with membranes. J Comput Syst Sci 61(1):108\u2013143 (Also in Turku Center for Computer Science-TUCS, Report 208, November 1998)","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"1732_CR11","first-page":"75","volume":"6","author":"G P\u0103un","year":"2001","unstructured":"P\u0103un G (2001) P systems with active membranes: attacking NP-complete problems. J Auto Langua Comb 6(1):75\u201390","journal-title":"J Auto Langua Comb"},{"key":"1732_CR12","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 (2002) Membrane computing: an introduction. Springer Science & Business Media, Berlin"},{"key":"1732_CR13","volume-title":"The Oxford handbook of membrane computing","year":"2010","unstructured":"P\u0103un G, Rozenberg G, Salomaa A (eds) (2010) The Oxford handbook of membrane computing. Oxford University Press, New York"},{"key":"1732_CR14","volume-title":"Handbook of formal languages","year":"1997","unstructured":"Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages. Springer, New York"},{"key":"1732_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.tcs.2013.11.014","volume":"529","author":"T Song","year":"2014","unstructured":"Song T, Mac\u00edas-Ramos LF, Pan L, P\u00e9rez-Jim\u00e9nez MJ (2014) Time-free solution to SAT problem using P systems with active membranes. Theor Comput Sci 529:61\u201368","journal-title":"Theor Comput Sci"},{"key":"1732_CR16","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2014.10.051","volume":"567","author":"B Song","year":"2015","unstructured":"Song B, Pan L (2015a) Computational efficiency and universality of timed P systems with active membranes. Theor Comput Sci 567:74\u201386","journal-title":"Theor Comput Sci"},{"key":"1732_CR17","doi-asserted-by":"crossref","unstructured":"Song B, Song T, Pan L (2015b) Time-free solution to SAT problem by P systems with active membranes and standard cell division rules. Nat Comput. doi: 10.1007\/s11047-014-9471-4","DOI":"10.1007\/s11047-014-9471-4"},{"key":"1732_CR18","author":"B Song","year":"2015","unstructured":"Song B, Song T, Pan L (2015c) A time-free uniform solution to subset sum problem by tissue P systems with cell division. Math Struct Comput Sci. doi: 10.1017\/S0960129515000018","journal-title":"Math Struct Comput Sci"},{"key":"1732_CR19","doi-asserted-by":"crossref","unstructured":"Song T, Wang X, Zheng H (2013) Time-free solution to Hamilton path problems using P systems with $$d$$ d -division. J Appl Math Article ID 975798","DOI":"10.1155\/2013\/975798"},{"key":"1732_CR20","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.biosystems.2012.01.007","volume":"108","author":"X Zhang","year":"2012","unstructured":"Zhang X, Luo B, Fang X, Pan L (2012) Sequential spiking neural P systems with exhaustive use of rules. BioSystems 108:52\u201362","journal-title":"BioSystems"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1732-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1732-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1732-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:43:48Z","timestamp":1559079828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1732-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,5]]},"references-count":20,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1732"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1732-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,5]]}}}