%0 Generic
%D 2015
%T Efficient solutions to hard computational problems by P systems with symport/antiport rules and membrane division
%A Bosheng Song
%A Mario J. Pérez-Jiménez
%A Linqiang Pan
%C San Diego, CA, USA
%I Elsevier
%K Cell-like P system; Symport/Antiport rule; Membrane division; Subset Sum problem; QSAT problem
%P 51-58
%R 10.1016/j.biosystems.2015.03.002
%U http://www.sciencedirect.com/science/article/pii/S0303264715000350
%V 130
%X P systems are computing models inspired by some basic features of biological membranes. In this work, membrane division, which provides a way to obtain an exponential workspace in linear time, is introduced into (cell-like) P systems with communication (symport/antiport) rules, where objects are never modified but they just change their places. The computational efficiency of this kind of P systems is studied. Specifically, we present a (uniform) linear time solution to the NP-complete problem, Subset Sum by using division rules for elementary membranes and communication rules of length at most 3. We further prove that such P system allowing division rules for non-elementary membranes can efficiently solve the PSPACE-complete problem, QSAT in a uniform way.
%8 04/2015