<?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%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Francisco J. Romero-Campero</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A linear solution of Subset Sum problem by using membrane creation</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Cellular complexity classes</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Natural computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Subset Sum Problem.</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/hhk559wmhg0qw87l/?p=16f5fea3cb444987a8c6641261510c68&pi=26</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam, The Netherlands</style></pub-location><volume><style face="normal" font="default" size="100%">3561</style></volume><pages><style face="normal" font="default" size="100%">258-267</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-26298-5</style></isbn><abstract><style face="normal" font="default" size="100%">Membrane Computing is a branch of Natural Computing which starts from the assumption that the processes taking place in the compartmental structure of a living cell can be interpreted as computations. In this framework, the solution of NP problems is obtained by generating an exponential amount on workspace in polynomial time and using parallelism to check simultaneously all the candidates to solution. We present a solution to the Subset Sum problem for P systems where new membranes are generated from objects.</style></abstract></record></records></xml>