<?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%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Agustín Riscos-Núñez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Solving the Subset-Sum problem by P systems with active membranes</style></title><secondary-title><style face="normal" font="default" size="100%">New Generation Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Active Membranes</style></keyword><keyword><style  face="normal" font="default" size="100%">Complexity Classes</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane 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><pub-location><style face="normal" font="default" size="100%">Tokyo, Japón</style></pub-location><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">367-384</style></pages><abstract><style face="normal" font="default" size="100%">We present the first membrane computing solution to the Subset-Sum problem using a family of deterministic P systems with active membranes. We do not use priority among rules, membrane dissolution nor cooperation; it suffices to control the electrical charges of the membranes and to introduce some counters. The number of steps of any computation is of the linear order (but it is necessary a polynomial-time of precomputed resources).

</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue></record></records></xml>