Evolving by maximizing the number of rules: complexity study

  • Authors:

  • Oana Agrigoroaiei;Gabriel Ciobanu;Andreas Resios

  • Affiliations:

  • Romanian Academy, Institute of Computer Science, Blvd. Carol I no.8, 700505 Iaşi, Romania, “A.I.Cuza” University, Iaşi, Romania;Romanian Academy, Institute of Computer Science, Blvd. Carol I no.8, 700505 Iaşi, Romania, “A.I.Cuza” University, Iaşi, Romania;Romanian Academy, Institute of Computer Science, Blvd. Carol I no.8, 700505 Iaşi, Romania, “A.I.Cuza” University, Iaşi, Romania

  • Venue:
  • WMC'09 Proceedings of the 10th international conference on Membrane Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.