论文信息 - A Linear Solution for QSAT with Membrane Creation

A Linear Solution for QSAT with Membrane Creation

The usefulness of P systems with membrane creation for solving NP problems has been previously proved (see [2, 3]), but, up to now, it was an open problem whether such P systems were able to solve PSPACE-complete problems in polynomial time. In this paper we give an answer to this question by presenting a uniform family of P system with membrane creation which solves the QSAT-problem in linear time.

Mario J. Pérez-Jiménez | Miguel A. Gutiérrez-Naranjo | Francisco José Romero-Campero

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

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

[3] Mario J. Pérez-Jiménez,et al. A Linear Solution of Subset Sum Problem by Using Membrane Creation , 2005, IWINAC.

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

[5] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

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

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

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

[9] P. Luisi. The Chemical Implementation of Autopoiesis , 1994 .

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

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