<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">Alberto Leporati</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Solving numerical NP-complete problems by spiking neural P systems with pre-computed resources </style></title><secondary-title><style face="normal" font="default" size="100%">6th Brainstorming Week on Membrane Computing</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Proceedings of the Sixth Brainstorming Week on Membrane Computing</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.gcn.us.es/6BWMC/volume/subsetsum.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Fénix Editora</style></publisher><pub-location><style face="normal" font="default" size="100%">Sevilla, Spain</style></pub-location><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">193-210</style></pages><isbn><style face="normal" font="default" size="100%">978-84-612-44 </style></isbn><abstract><style face="normal" font="default" size="100%">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–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.</style></abstract></record></records></xml>