Tissue P systems with cell separation: attacking the partition problem

Tissue P systems are distributed parallel and non-deterministic computing models in the framework of membrane computing, which are inspired by intercellular communication and cooperation between neurons. Recently, cell separation is introduced into tissue P systems, which enables systems to generate an exponential workspace in a polynomial time. In this work, the computational power of tissue P systems with cell separation is investigated. Specifically, a uniform family of tissue P systems with cell separation is constructed for efficiently solving a well-known NP-complete problem, the partition problem.

[1]  Mario J. Pérez-Jiménez,et al.  A uniform family of tissue P systems with cell division solving 3-COL in a linear time , 2008, Theor. Comput. Sci..

[2]  Gheorghe Păun,et al.  Tissue P Systems with Cell Division , 2008, Int. J. Comput. Commun. Control.

[3]  Marian Gheorghe,et al.  Cell communication in tissue P systems: universality results , 2005, Soft Comput..

[4]  Marian Gheorghe,et al.  Cell Communication in Tissue P Systems and Cell Division in Population P Systems , 2004 .

[5]  Raghavan Rama,et al.  Tissue P Systems with Contextual and Rewriting Rules , 2002, WMC-CdeA.

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

[7]  Mario J. Pérez-Jiménez,et al.  A Linear-time Tissue P System Based Solution for the 3-coloring Problem , 2007, Electron. Notes Theor. Comput. Sci..

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

[9]  Artiom Alhazov,et al.  Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells , 2005, Developments in Language Theory.

[10]  D. Diaz-Pernil,et al.  A fast solution to the partition problem by using tissue-like P systems , 2008, 2008 3rd International Conference on Bio-Inspired Computing: Theories and Applications.

[11]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[12]  Andrei Paun,et al.  The power of communication: P systems with symport/antiport , 2002, New Generation Computing.

[13]  Mario J. Pérez-Jiménez,et al.  Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division , 2007, IWINAC.

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

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

[16]  Alfonso Rodríguez-Patón,et al.  A New Class of Symbolic Abstract Neural Nets: Tissue P Systems , 2002, COCOON.

[17]  Alfonso Rodríguez-Patón,et al.  Tissue P systems , 2003, Theor. Comput. Sci..

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

[19]  Mario J. Pérez-Jiménez,et al.  Computational complexity of tissue-like P systems , 2010, J. Complex..

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

[21]  Rudolf Freund,et al.  Tissue P systems with channel states , 2005, Theor. Comput. Sci..

[22]  Mario J. Pérez-Jiménez,et al.  A uniform solution to SAT using membrane creation , 2007, Theor. Comput. Sci..