@article {509,
	title = {Characterizing tractability by tissue-like P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {5957},
	year = {2010},
	note = {Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009, Revised Selected and Invited Papers.},
	month = {01/2010},
	pages = {289-300},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {In the framework of recognizer cell{\textendash}like membrane systems it is well known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP{\textendash}complete problems. Nonetheless, it may be sufficient to create an exponential number of membranes in polynomial time.
In this paper, we study the computational efficiency of recognizer tissue P systems with communication (symport/antiport) rules and division rules. Some results have been already obtained in this direction: (a) using communication rules and making no use of division rules, only tractable problems can be efficiently solved; (b) using communication rules with length three and division rules, NP{\textendash}complete problems can be efficiently solved. In this paper, we show that the length of communication rules plays a relevant role from the efficiency point of view for this kind of P systems.
},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-11467-0_21},
	url = {http://springerlink.com/content/h2272531j487qu50/?p=75abf8145d6743f3ae89252f7fba0541\&pi=20},
	author = {Rosa Guti{\'e}rrez-Escudero and Mario J. P{\'e}rez-Jim{\'e}nez and Miquel Rius-Font}
}
