Complexity aspects of polarizationless membrane systems

We investigate polarizationless P systems with active membranes working in maximally parallel manner, which do not make use of evolution or communication rules, in order to find which features are sufficient to efficiently solve computationally hard problems. We show that such systems are able to solve the PSPACE-complete problem Quantified 3-sat, provided that non-elementary membrane division is controlled by the presence of a (possibly non-elementary) membrane.

[1]  Artiom Alhazov,et al.  Uniform Solution to QSAT Using Polarizationless Active Membranes , 2006 .

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

[3]  Mario J. Pérez-Jiménez,et al.  On the Power of Dissolution in P Systems with Active Membranes , 2005, Workshop on Membrane Computing.

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

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

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

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

[8]  K. G. Subramanian,et al.  Formal Models, Languages and Applications [this volume commemorates the 75th birthday of Prof. Rani Siromoney] , 2007, Formal Models, Languages and Applications.

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

[10]  Giancarlo Mauri,et al.  On a Paun's Conjecture in Membrane Systems , 2007, IWINAC.

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

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

[13]  Mario J. Pérez-Jiménez,et al.  Solving the Subset-Sum problem by P systems with active membranes , 2009, New Generation Computing.

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

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

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

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

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

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

[20]  Mario J. Pérez-Jiménez,et al.  The P Versus NP Problem Through Cellular Computing with Membranes , 2004, Aspects of Molecular Computing.

[21]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

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

[23]  John L. Casti,et al.  Unconventional Models of Computation , 2002, Lecture Notes in Computer Science.

[24]  Gabriel Ciobanu,et al.  P systems with minimal parallelism , 2007, Theor. Comput. Sci..

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

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

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