Uniform Solution of

It is known that the satisfiability problem (SAT) can be solved with a semi-uniform family of deterministic polarizationless P systems with active membranes with non-elementary membrane division. We present a double improvement of this result by showing that the satisfiability of a quantified Boolean formula (QSAT) can be solved by a uniform family of P systems of the same kind.

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

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

[3]  Mario J. Pérez-Jiménez,et al.  P Systems with Active Membranes, Without Polarizations and Without Dissolution: A Characterization of P , 2005, UC.

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

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

[6]  Grzegorz Rozenberg,et al.  Aspects of Molecular Computing , 2004, Lecture Notes in Computer Science.

[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]  Petr Sosík.  The computational power of cell division in P systems: Beating down parallel computers? , 2004, Natural Computing.

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

[11]  Gheorghe Paun,et al.  On the power of membrane division in P systems , 2004, Theor. Comput. Sci..

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

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

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

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

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

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

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

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

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

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