Design Patterns for Efficient Solutions to NP-Complete Problems in Membrane Computing
Many variants of P systems have the ability to generate an exponential number of membranes in linear time. This feature has been exploited to elaborate (theoretical) efficient solutions to NP-complete, or even harder, problems. A thorough review of the existent solutions shows the utilization of com...
| Autores: | , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2018 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/84779 |
| Acceso en línea: | https://hdl.handle.net/11441/84779 https://doi.org/10.1007/978-3-030-00265-7_19 |
| Access Level: | acceso abierto |
| Palabra clave: | Membrane Computing NP-complete problems Efficient solutions Design patterns SAT problem |
| Sumario: | Many variants of P systems have the ability to generate an exponential number of membranes in linear time. This feature has been exploited to elaborate (theoretical) efficient solutions to NP-complete, or even harder, problems. A thorough review of the existent solutions shows the utilization of common techniques and procedures. The abstraction of the latter into design patterns can serve to ease and accelerate the construction of efficient solutions to new hard problems. |
|---|