%0 Generic
%D 2003
%T Complexity Classes in Cellular Computing with Membranes
%A Mario J. Pérez-Jiménez
%A Álvaro Romero-Jiménez
%A Fernando Sancho-Caparrini
%C Seville (Spain)
%P 4
%S First Joint Meeting between the RSME and the AMS. Abstracts
%X 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.
%8 18-21/06/2003