论文信息 - A Linear Solution of Subset Sum Problem by Using Membrane Creation

A Linear Solution of Subset Sum Problem by Using Membrane Creation

Membrane Computing is a branch of Natural Computing which starts from the assumption that the processes taking place in the compartmental structure of a living cell can be interpreted as computations. In this framework, the solution of NP problems is obtained by generating an exponential amount on workspace in polynomial time and using parallelism to check simultaneously all the candidates to solution. We present a solution to the Subset Sum problem for P systems where new membranes are generated from objects.

Mario J. Pérez-Jiménez | Miguel A. Gutiérrez-Naranjo | Francisco José Romero-Campero

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

[2] Gheorghe Paun. Further Open Problems in Membrane Computing , 2004 .

[3] Gheorghe Paun,et al. Recent Computability Models Inspired from Biology: DNA and Membrane Computing , 2003 .

[4] P. Luisi. The Chemical Implementation of Autopoiesis , 1994 .

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

[6] Mario J. Pérez-Jiménez,et al. Towards a Programming Language in Cellular Computing , 2005, Electron. Notes Theor. Comput. Sci..

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

[8] Mario de Jesús Pérez Jiménez,et al. Solving SAT with membrane creation , 2005 .

[9] P. Luisi,et al. Self-Production of Supramolecular Structures , 1994 .

[10] Gheorghe Paun,et al. Computing with Membranes , 2000, J. Comput. Syst. Sci..

[11] 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.

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