Artículo
Solving the Subset-Sum Problem by P Systems with Active Membranes
Autor/es | Pérez Jiménez, Mario de Jesús
Riscos Núñez, Agustín |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2005 |
Fecha de depósito | 2021-04-27 |
Publicado en |
|
Resumen | We present the first membrance computing solution to the Subset-Sum problem using a family of deterministic P systems with active membranes. We do not use priority among rules, membrane dissolution nor cooperation; it ... We present the first membrance computing solution to the Subset-Sum problem using a family of deterministic P systems with active membranes. We do not use priority among rules, membrane dissolution nor cooperation; it suffices to control the electrical charges of the membranes and to introduce some counters. The number of steps of any computation is of the linear order (but it is necessary a polynomial-time of precomputed resources). |
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 Riscos Núñez, A. (2005). Solving the Subset-Sum Problem by P Systems with Active Membranes. New Generation Computing, 23, 339-356. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Solving the subset-sum problem ... | 1021.Kb | [PDF] | Ver/ | |