@article {,
	title = { A uniform solution to SAT using membrane creation},
	journal = {Theoretical Computer Science},
	volume = {371},
	year = {2007},
	pages = {54-61},
	address = {Amsterdam, Holanda},
	abstract = {In living cells, new membranes are produced basically through two processes: mitosis and autopoiesis. These two processes have inspired two variants of cell-like membrane systems, namely P systems with active membranes and P systems with membrane creation. In this paper, we provide the first uniform, efficient solution to the SAT problem in the framework of recogniser P systems with membrane creation using dissolution rules. Recently the authors have proved that if the dissolution rules are not allowed to be used, then the polynomial complexity class associated with this variant of P systems is the standard complexity class P. This result, together with the main result of this paper, shows the surprising role of the apparently {\textquotedblleft}innocent{\textquotedblright} operation of membrane dissolution. The use of this type of rule establishes the difference between efficiency and non-efficiency for P systems with membrane creation, and provides a barrier between P and NP (assuming ). 

},
	keywords = {Cellular complexity classes, Membrane computing, Natural computing, SAT problem},
	doi = {10.1016/j.tcs.2006.10.013},
	url = {http://dx.doi.org/10.1016/j.tcs.2006.10.013},
	attachments = {http://www.gcn.us.es/biblio/q=node/files/themes/misc/files/A Uniform Solution to SAT Using Membrane Creation.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Francisco J. Romero-Campero}
}
