Solving the Subset-Sum Problem by P Systems with Active Membranes
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...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2005 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/107881 |
| Acesso em linha: | https://hdl.handle.net/11441/107881 https://doi.org/10.1007/BF03037637 |
| Access Level: | acceso abierto |
| Palavra-chave: | Membrane Computing Complexity Classes Active membranes Subset-Sum Problem |
| Resumo: | 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). |
|---|