Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division
Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division
复制标题
DOI：
10.1007/978-3-540-73053-8_17
复制
发表时间：
2007-06
期刊：
影响因子：
--
通讯作者：
D. Díaz-Pernil;M. A. Gutiérrez-Naranjo;M. Pérez-Jiménez;A. Riscos-Núñez
中科院分区：
文献类型：
--
作者：
D. Díaz-Pernil;M. A. Gutiérrez-Naranjo;M. Pérez-Jiménez;A. Riscos-Núñez
具有细胞分裂的组织P系统是膜计算框架下的一种基于细胞间通讯和神经元间合作的计算模型。细胞分裂的能力使我们能够在线性时间内获得指数数量的细胞，并在多项式时间内设计出tonp完全问题的细胞解。在本文中，我们提出了一种解决子集和问题的方法。这是利用细胞分裂的组织P系统解决数值np完全问题的第一个方法。
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 toNP-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 numericalNP-complete problem by using tissue P systems with cell division.