论文信息 - Solving the Subset-Sum problem by P systems with active membranes

Solving the Subset-Sum problem by P systems with active membranes

We present the first membrance computing solution to the Subset-Sum problem using a family of deterministic P systems with active membranes. We do not use priority among rules, membrane dissolution nor cooperation; it suffices to control the electrical charges of the membranes and to introduce some counters. The number of steps of any computation is of the linear order (but it is necessary a polynomial-time of precomputed resources).

Agustín Riscos Núñez | Mario J. Pérez Jiménez

[1] Fred Joseph Gruenberger,et al. Computing: An Introduction , 1969 .

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

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

[4] Mario J. Pérez-Jiménez,et al. Decision P Systems and the P!=NP Conjecture , 2002, WMC-CdeA.

[5] Mario J. Pérez-Jiménez,et al. Cellular Solutions to Some Numerical NP-Complete Problems: A Prolog Implementation , 2005 .

[6] Mario de Jesús Pérez Jiménez,et al. Complexity Classes in Cellular Computing with Membranes , 2003 .

[7] Mario J. Pérez-Jiménez,et al. Complexity classes in models of cellular computing with membranes , 2003, Natural Computing.

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

[9] Gheorghe Paun. P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..