2017-01-122017-01-122005Pérez Jiménez, M.d.J., y Romero Campero, F.J. (2005). Attacking the Common Algorithmic Problem by Recognizer P Systems. En Computations and Universality, MCU'2004, Saint Petesburg, Russia, September 2004, Revised Selected Papers Lecture Notes in Computer Science, 3354 (2005) (pp. 304-315). Berlin: Springer.978-3-540-25261-00302-9743http://hdl.handle.net/11441/52167Many 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.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Membrane computingCommon Algorithmic ProblemCellular Complexity Classesinfo:eu-repo/semantics/bookPartinfo:eu-repo/semantics/openAccess10.1007/978-3-540-31834-7_25