@article {437,
	title = {Solving numerical NP-complete problems by spiking neural P systems with pre-computed resources },
	journal = {6th Brainstorming Week on Membrane Computing},
	volume = {6},
	year = {2008},
	pages = {193-210},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Spain},
	abstract = {Recently we have considered the possibility of using spiking neural P systems
for solving computationally hard problems, under the assumption that some (possibly exponentially
large) pre-computed resources are given in advance. In this paper we continue
this research line, and we investigate the possibility of solving numerical NP-complete
problems such as Subset Sum. In particular, we first propose a semi{\textendash}uniform family of
spiking neural P systems in which every system solves a specified instance of Subset
Sum. Then, we exploit a technique used to calculate Iterated Addition with boolean
circuits to obtain a uniform family of spiking neural P systems in which every system
is able to solve all the instances of Subset Sum of a fixed size. All the systems here
considered are deterministic, but their size generally grows exponentially with respect to
the instance size.},
	isbn = {978-84-612-44 },
	url = {http://www.gcn.us.es/6BWMC/volume/subsetsum.pdf},
	author = {Miguel A. Guti{\'e}rrez-Naranjo and Alberto Leporati}
}
