%0 Generic
%D 2007
%T Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division
%A Daniel Díaz-Pernil
%A Miguel A. Gutiérrez-Naranjo
%A Mario J. Pérez-Jiménez
%A Agustín Riscos-Núñez
%C Amsterdam, The Netherlands
%I Springer
%P 170-179
%R 10.1007/978-3-540-73053-8
%U http://www.springerlink.com/index/q64n502j641026nu.pdf
%V 4527
%X 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.