Capítulo de Libro
Attacking the Common Algorithmic Problem by Recognizer P Systems
Autor/es | Pérez Jiménez, Mario de Jesús
Romero Campero, Francisco José |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2005 |
Fecha de depósito | 2017-01-12 |
Publicado en |
|
ISBN/ISSN | 978-3-540-25261-0 0302-9743 |
Resumen | 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 ... 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. |
Agencias financiadoras | Ministerio de Ciencia y Tecnología (MCYT). España |
Identificador del proyecto | TIC2002-04220-C03-01 |
Cita | Pé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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
chp%3A10.1007%2F978-3-540-3183 ... | 284.8Kb | [PDF] | Ver/ | |