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

Uniform solutions to SAT and Subset Sum by spiking neural P systems

Opened Access Uniform solutions to SAT and Subset Sum by spiking neural P systems


buscar en

Exportar a
Autor: Leporati, Alberto
Mauri, Giancarlo
Zandron, Claudio
Paun, Gheorghe
Pérez Jiménez, Mario de Jesús
Departamento: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Fecha: 2009
Publicado en: Natural Computing, 8 (4), 681-702.
Tipo de documento: Artículo
Resumen: We continue the investigations concerning the possibility of using spiking neural P systems as a framework for solving computationally hard problems, addressing two problems which were already recently considered in this respect: Subset Sum and SAT: For both of them we provide uniform constructions of standard spiking neural P systems (i.e., not using extended rules or parallel use of rules) which solve these problems in a constant number of steps, working in a non-deterministic way. This improves known results of this type where the construction was non-uniform, and/or was using various ingredients added to the initial definition of spiking neural P systems (the SN P systems as defined initially are called here ‘‘standard’’). However, in the Subset Sum case, a price to pay for this improvement is that the solution is obtained either in a time which depends on the value of the numbers involved in the problem, or by using a system whose size depends on the same values, or ag...
[Ver más]
Cita: Leporati, A., Mauri, G., Zandron, C., Paun, G. y Pérez Jiménez, M.d.J. (2009). Uniform solutions to SAT and Subset Sum by spiking neural P systems. Natural Computing, 8 (4), 681-702.
Tamaño: 1.689Mb
Formato: PDF


DOI: 10.1007/s11047-008-9091-y

Ver versión del editor

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