<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Álvaro Romero-Jiménez</style></author><author><style face="normal" font="default" size="100%">Fernando Sancho-Caparrini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Complexity Classes in Cellular Computing with Membranes</style></title><secondary-title><style face="normal" font="default" size="100%">First Joint Meeting between the RSME and the AMS</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">First Joint Meeting between the RSME and the AMS. Abstracts</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">18-21/06/2003</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Seville (Spain)</style></pub-location><pages><style face="normal" font="default" size="100%">4</style></pages><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record></records></xml>