Abstract
Tissue P systems with cell division is a computing model in the framework of Membrane Computing based on intercellular communication and cooperation between neurons. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to NP-complete problems in polynomial time. In this paper we present a solution to the Subset Sum problem via a family of such devices. This is the first solution to a numerical NP-complete problem by using tissue P systems with cell division. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Díaz-Pernil, D., Gutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J., & Riscos-Núñez, A. (2007). Solving subset sum in linear time by using tissue P systems with cell division. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4527 LNCS, pp. 170–179). Springer Verlag. https://doi.org/10.1007/978-3-540-73053-8_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
