{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:41:07Z","timestamp":1725543667648},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114663"},{"type":"electronic","value":"9783642114670"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11467-0_11","type":"book-chapter","created":{"date-parts":[[2010,1,19]],"date-time":"2010-01-19T15:49:33Z","timestamp":1263916173000},"page":"149-157","source":"Crossref","is-referenced-by-count":1,"title":["Evolving by Maximizing the Number of Rules: Complexity Study"],"prefix":"10.1007","author":[{"given":"Oana","family":"Agrigoroaiei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Ciobanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Resios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"49","volume":"87","author":"G. Ciobanu","year":"2008","unstructured":"Ciobanu, G., Resios, A.: Computational complexity of simple P systems. Fundamenta Informaticae\u00a087, 49\u201359 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ciobanu, G., Resios, A.: Complexity of evolution in maximum cooperative P systems. Natural Computing (2009) (accepted, available online)","DOI":"10.1007\/s11047-009-9107-2"},{"key":"11_CR3","first-page":"157","volume":"12","author":"G. Ciobanu","year":"2009","unstructured":"Ciobanu, G., Marcus, S., P\u0103un, Gh.: New strategies of using the rules of a P system in a maximal way. Romanian Journal of Information Science and Technology\u00a012, 157\u2013173 (2009)","journal-title":"Romanian Journal of Information Science and Technology"},{"key":"11_CR4","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. Freeman & Co., New York (1979)"},{"key":"11_CR5","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, New York (1998)"},{"key":"11_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Computing with Membranes: An Introduction","author":"G. P\u0103un","year":"2002","unstructured":"P\u0103un, Gh.: Computing with Membranes: An Introduction. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Membrane Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11467-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:52:25Z","timestamp":1619783545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11467-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114663","9783642114670"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11467-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}