@article {300,
	title = {Complexity Classes in Cellular Computing with Membranes},
	journal = {First Joint Meeting between the RSME and the AMS},
	year = {2003},
	month = {18-21/06/2003},
	pages = {4},
	address = {Seville (Spain)},
	abstract = {Given a class of recognizer membrane systems F, the complexity class PMC_F of all prob-
lems solvable in polynomial time by a family of P systems of type F is presented. This
complexity class is stable by polynomial time reduction, and offer a new way to attack the
P = NP conjecture, now inside the framework of the cellular computing with membranes.},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
