P Systems with Active Membranes, Without Polarizations and Without Dissolution: A Characterization of P

We study the computational efficiency of recognizer P systems with active membranes without polarizations and without dissolution. The main result of the paper is the following: the polynomial computational complexity class associated with the class of recognizer P systems is equal to the standard complexity class P.

[1]  Michael Randolph Garey,et al.  Johnson: "computers and intractability , 1979 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

[5]  Petr Sosík.  The computational power of cell division in P systems: Beating down parallel computers? , 2004, Natural Computing.

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

[7]  Mario J. Pérez-Jiménez,et al.  An Approach to Computational Complexity in Membrane Computing , 2004, Workshop on Membrane Computing.

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

[9]  Zbigniew Michalewicz,et al.  Evolutionary algorithms , 1997, Emerging Evolutionary Algorithms for Antennas and Wireless Communications.

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

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

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

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

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

[15]  Thomas Bäck,et al.  Evolutionary Algorithms: The Role of Mutation and Recombination , 2000 .

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

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