A computational complexity theory in membrane computing

In this paper, a computational complexity theory within the framework of Membrane Computing is introduced. Polynomial complexity classes associated with different models of cell-like and tissue-like membrane systems are defined and the most relevant results obtained so far are presented. Many attractive characterizations of P ≠ NP conjecture within the framework of a bio-inspired and non-conventional computing model are deduced.

[1]  Mario J. Pérez-Jiménez,et al.  Membrane Dissolution and Division in P , 2009, UC.

[2]  Niall Murphy,et al.  Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P , 2007, Workshop on Membrane Computing.

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

[4]  Giancarlo Mauri,et al.  On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution , 2008, Fundam. Informaticae.

[5]  Artiom Alhazov,et al.  Further remarks on P systems with active membranes, separation, merging, and release rules , 2005, Soft Comput..

[6]  Mario J. Pérez-Jiménez,et al.  Characterizing Tractability by Tissue-Like P Systems , 2009, Workshop on Membrane Computing.

[7]  Mario de Jesús Pérez Jiménez,et al.  An Efficient Family of P Systems for Packing Items into Bins , 2004 .

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

[9]  Artiom Alhazov,et al.  On the Efficiency of P Systems with Active Membranes and Two Polarizations , 2004, Workshop on Membrane Computing.

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

[11]  Alfonso Rodríguez-Patón,et al.  Membrane computing and complexity theory: A characterization of PSPACE , 2007, J. Comput. Syst. Sci..

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

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

[14]  Linqiang Pan,et al.  P Systems with Active Membranes and Separation Rules , 2004, J. Univers. Comput. Sci..

[15]  Artiom Alhazov,et al.  Uniform Solution of , 2007, MCU.

[16]  Mario J. Pérez-Jiménez,et al.  Characterizing Tractability by Cell-Like Membrane Systems , 2007, Formal Models, Languages and Applications.

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

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

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

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

[21]  Mario de Jesús Pérez Jiménez,et al.  Computational Efficiency of Cellular Division in Tissue-like Membrane Systems , 2008 .

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

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

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

[25]  Giancarlo Mauri,et al.  Solving NP-Complete Problems Using P Systems with Active Membranes , 2000, UMC.

[26]  Gheorghe Paun.  Further Twenty Six Open Problems in Membrane Computing , 2005 .

[27]  Giancarlo Mauri,et al.  Complexity classes for membrane systems , 2006, RAIRO Theor. Informatics Appl..

[28]  Mario J. Pérez-Jiménez,et al.  An Efficient Family of P Systems for Packing Items into Bins , 2004, J. Univers. Comput. Sci..

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

[30]  Artiom Alhazov,et al.  Solving Graph Problems by P Systems with Restricted Elementary Active Membranes , 2004, Aspects of Molecular Computing.

[31]  Mario J. Pérez-Jiménez,et al.  Trading Polarization for Bi-stable Catalysts in P Systems with Active Membranes , 2004, Workshop on Membrane Computing.

[32]  Artiom Alhazov,et al.  Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes , 2003, Fundam. Informaticae.

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

[34]  Giancarlo Mauri,et al.  Complexity aspects of polarizationless membrane systems , 2008, Natural Computing.

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

[36]  Mario J. Pérez-Jiménez,et al.  Efficient simulation of tissue-like P systems by transition cell-like P systems , 2008, Natural Computing.

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

[38]  M. J. P. Jiménez,et al.  On the power of dissolution in p systems with active membranes , 2005 .

[39]  Artiom Alhazov,et al.  Trading polarizations for labels in P systems with active membranes , 2004, Acta Informatica.