@article {1929,
	title = {Efficient solutions to hard computational problems by P systems with symport/antiport rules and membrane division},
	journal = {Biosystems},
	volume = {130},
	year = {2015},
	month = {04/2015},
	pages = {51-58},
	publisher = {Elsevier},
	address = {San Diego, CA, USA},
	abstract = {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.},
	keywords = {Cell-like P system; Symport/Antiport rule; Membrane division; Subset Sum problem; QSAT problem},
	issn = {0303-2647},
	doi = {10.1016/j.biosystems.2015.03.002},
	url = {http://www.sciencedirect.com/science/article/pii/S0303264715000350},
	author = {Bosheng Song and Mario J. P{\'e}rez-Jim{\'e}nez and Linqiang Pan}
}
