A Logarithmic Bound for Solving Subset Sum with P Systems

The aim of our paper is twofold. On one hand we prove the ability of polarizationless P systems with dissolution and with division rules for non-elementary membranes to solve NP-complete problems in a polynomial number of steps, and we do this by presenting a solution to the Subset Sum problem. On the other hand, we improve some similar results obtained for different models of P systems by reducing the number of steps and the necessary resources to be of a logarithmic order with respect to k (recall that n and k are the two parameters used to indicate the size of an instance of the Subset Sum problem). As the model we work with does not allow cooperative rules and does not consider the membranes to have an associated polarization, the strategy that we will follow consists on using objects to represent the weights of the subsets through their multiplicities, and comparing the number of objects against a fixed number of membranes. More precisely, we will generate k membranes in log k steps.

[1]  Mario J. Pérez-Jiménez,et al.  A Linear Solution of Subset Sum Problem by Using Membrane Creation , 2005, IWINAC.

[2]  Rudolf Freund,et al.  P systems with active membranes and without polarizations , 2005, Soft Comput..

[3]  Mario J. Pérez-Jiménez,et al.  A Linear Solution for QSAT with Membrane Creation , 2005, Workshop on Membrane Computing.

[4]  Agustín Riscos-Núñez,et al.  Computational efficiency of dissolution rules in membrane systems , 2006, Int. J. Comput. Math..

[5]  Mario J. Pérez-Jiménez,et al.  Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division , 2007, IWINAC.

[6]  Mario J. Pérez-Jiménez,et al.  Attacking the Common Algorithmic Problem by Recognizer P Systems , 2004, MCU.

[7]  Mario J. Pérez-Jiménez,et al.  A Linear-Time Solution to the Knapsack Problem Using P Systems with Active Membranes , 2003, Workshop on Membrane Computing.

[8]  Mario de Jesús Pérez Jiménez,et al.  Attacking the common algorithmic problem by recognizer p systems , 2004 .

[9]  Agustín Riscos Núñez,et al.  Solving the Subset-Sum problem by P systems with active membranes , 2005 .

[10]  Gheorghe Paun,et al.  Computing with Membranes: Attacking NP-Complete Problems , 2000, UMC.

[11]  Mario J. Pérez-Jiménez,et al.  A Polynomial Complexity Class in P Systems Using Membrane Division , 2003, DCFS.

[12]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[13]  Mario J. Pérez-Jiménez,et al.  A fast P system for finding a balanced 2-partition , 2005, Soft Comput..

[14]  Vincent Danos,et al.  Self Assembling Graphs , 2005, IWINAC.

[15]  Mario J. Pérez-Jiménez,et al.  On the Power of Dissolution in P Systems with Active Membranes , 2005, Workshop on Membrane Computing.