Mostrar el registro sencillo del ítem
Artículo
Solving the Subset-Sum Problem by P Systems with Active Membranes
dc.creator | Pérez Jiménez, Mario de Jesús | es |
dc.creator | Riscos Núñez, Agustín | es |
dc.date.accessioned | 2021-04-27T07:03:01Z | |
dc.date.available | 2021-04-27T07:03:01Z | |
dc.date.issued | 2005 | |
dc.identifier.citation | Pérez Jiménez, M.d.J. y Riscos Núñez, A. (2005). Solving the Subset-Sum Problem by P Systems with Active Membranes. New Generation Computing, 23, 339-356. | |
dc.identifier.issn | 0288-3635 | es |
dc.identifier.uri | https://hdl.handle.net/11441/107881 | |
dc.description.abstract | We present the first membrance 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). | es |
dc.description.sponsorship | Ministerio de Ciencia y Tecnología TIC2002-04220-C03-01 | es |
dc.format | application/pdf | es |
dc.format.extent | 18 | es |
dc.language.iso | eng | es |
dc.publisher | Springer | es |
dc.relation.ispartof | New Generation Computing, 23, 339-356. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Membrane Computing | es |
dc.subject | Complexity Classes | es |
dc.subject | Active membranes | es |
dc.subject | Subset-Sum Problem | es |
dc.title | Solving the Subset-Sum Problem by P Systems with Active Membranes | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial | es |
dc.relation.projectID | TIC2002-04220-C03-01 | es |
dc.relation.publisherversion | https://link.springer.com/article/10.1007/BF03037637 | es |
dc.identifier.doi | 10.1007/BF03037637 | es |
dc.contributor.group | Universidad de Sevilla. TIC193: Computación Natural | es |
dc.journaltitle | New Generation Computing | es |
dc.publication.issue | 23 | es |
dc.publication.initialPage | 339 | es |
dc.publication.endPage | 356 | es |
dc.identifier.sisius | 6653994 | es |
dc.contributor.funder | Ministerio de Ciencia Y Tecnología (MCYT). España | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Solving the subset-sum problem ... | 1021.Kb | ![]() | Ver/ | |