Repositorio de producción científica de la Universidad de Sevilla

A Linear Solution for Subset Sum Problem with Tissue P Systems with Cell Division

Opened Access A Linear Solution for Subset Sum Problem with Tissue P Systems with Cell Division
Estadísticas
Icon
Exportar a
Autor: Díaz Pernil, Daniel
Gutiérrez Naranjo, Miguel Ángel
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: 2007
Publicado en: Proceedings of the Fifth Brainstorming Week on Membrane Computing, 113-130. Sevilla, E.T.S. de Ingeniería Informática, 29 de Enero-2 de Febrero, 2007
ISBN/ISSN: 9788461167760
Tipo de documento: Ponencia
Resumen: Tissue P systems are a computing model in the framework of Membrane Computing where the tree-like membrane structure is replaced by a general graph. Recently, it has been shown that endowing these P systems with cell division, NP-complete problems can be solved in polynomial time. In this paper we present a solution to the Subset Sum problem via a family of such devices, and we also include the formal verification of such solution. This is the first solution to a numerical NP-complete problem by using tissue P systems with cell division.
Tamaño: 214.6Kb
Formato: PDF

URI: http://hdl.handle.net/11441/38528

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones