论文信息 - Attacking the common algorithmic problem by recognizer p systems

Attacking the common algorithmic problem by recognizer p systems

Many NP-complete problems can be viewed as special cases of the Common Algorithmic Problem (CAP). In a precise sense, which will be defined in the paper, one may say that CAP has a property of local universality. In this paper we present an effective solution to the decision version of the CAP using a family of recognizer P systems with active membranes. The analysis of the solution presented here will be done from the point of view of complexity classes in P systems.

Mario de Jesús Pérez Jiménez | 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] Mario J. Pérez-Jiménez,et al. A Polynomial Complexity Class in P Systems Using Membrane Division , 2003, DCFS.

[3] T. Head,et al. Aqueous computing: writing on molecules , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[5] Mario de Jesús Pérez Jiménez,et al. Towards a Programming Language in Cellular Computing , 2004 .

[6] Mario de Jesús Pérez Jiménez,et al. Modelos de computación celular con membranas , 2004 .

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

[8] Mario de Jesús Pérez Jiménez,et al. A CLIPS Simulator for Recognizer P Systems with Active Membranes , 2004 .

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

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