Complexity Classes in Cellular Computing with Membranes

Tue, 01/08/2008 - 12:27 — ana

Title	Complexity Classes in Cellular Computing with Membranes
Publication Type	Conference Contributions
Year of Publication	2003
Authors	Pérez-Jiménez, M. J., Romero-Jiménez Á., & Sancho-Caparrini F.
Conference Name	First Joint Meeting between the RSME and the AMS
Volume Title	First Joint Meeting between the RSME and the AMS. Abstracts
Place Published	Seville (Spain)
Pages	4
Date Published	18-21/06/2003
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.