<?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 models of cellular computing with membranes</style></title><secondary-title><style face="normal" font="default" size="100%">Natural Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Complexity Classes</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">P systems</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1023/A:1025449224520</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam, Netherlands</style></pub-location><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">265 - 285   </style></pages><abstract><style face="normal" font="default" size="100%">In this paper we introduce four complexity classes for cellular computing systems with membranes: the first and the second ones contain all decision problems solvable in polynomial time by a family of deterministic P systems, without and with an input membrane, respectively; the third and fourth classes contain all decision problems solvable in polynomial time by a family of non-deterministic P systems, without and with an input membrane, respectively. We illustrate the usefulness of these classes by solving two NP–complete problems, namely HPP and SAT, in both variants of P systems.



</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record></records></xml>