Abstract
This paper presents the complexity of finding a multiset of rules in a P system in such a way to have a maximal number of rules applied. It is proved that the decision version of this problem is NP-complete. We study a number of subproblems obtained by considering that a rule can be applied at most once, and by considering the number of objects in the alphabet of the membrane as being fixed. When considering P systems with simple rules, the corresponding decision problem is in P. When considering P systems having only two types of objects, and P systems in which a rule is applied at most once, their corresponding decision problems are NP-complete. We compare these results with those obtained for maxO evolution.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ciobanu, G., Resios, A.: Computational complexity of simple P systems. Fundamenta Informaticae 87, 49–59 (2008)
Ciobanu, G., Resios, A.: Complexity of evolution in maximum cooperative P systems. Natural Computing (2009) (accepted, available online)
Ciobanu, G., Marcus, S., Păun, Gh.: New strategies of using the rules of a P system in a maximal way. Romanian Journal of Information Science and Technology 12, 157–173 (2009)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman & Co., New York (1979)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, New York (1998)
Păun, Gh.: Computing with Membranes: An Introduction. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrigoroaiei, O., Ciobanu, G., Resios, A. (2010). Evolving by Maximizing the Number of Rules: Complexity Study. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2009. Lecture Notes in Computer Science, vol 5957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11467-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-11467-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11466-3
Online ISBN: 978-3-642-11467-0
eBook Packages: Computer ScienceComputer Science (R0)