%0 Generic
%D 2005
%T Attacking the Common Algorithmic Problem by recognizer P systems
%A Mario J. Pérez-Jiménez
%A Francisco J. Romero-Campero
%C Amsterdam, The Netherlands
%I Springer
%P 304-315
%R 10.1007/b106980
%U http://www.springerlink.com/content/ej5qbb069jtdun0m/?p=7d7b28198e4e471f8cc386df2df8c035&pi=24
%V 3354
%X Many NP-complete problems can be viewed as special cases of the Common Algorithmic Problem (CAP). In a precise sense, which will be defined in the paper, one may say that CAP has a property of local universality. In this paper we present an effective solution to the decision version of the CAP using a family of recognizer P systems with active membranes. The analysis of the solution presented here will be done from the point of view of complexity classes in P systems.
%@ 978-3-540-25261-0