Solving Common Algorithmic Problem by Recognizer Tissue P Systems
Common Algorithmic Problem is an optimization problem, which has the nice property that several other NP-complete problems can be reduced to it in linear time. In this work, we deal with its decision version in the framework of tissue P systems. A tissue P system with cell division is a computing mo...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2012 |
| 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/79690 |
| Acesso em linha: | https://hdl.handle.net/11441/79690 |
| Access Level: | acceso abierto |
| Palavra-chave: | Membrane Computing Tissue P system Cell division Common algorithmic problem |
| Resumo: | Common Algorithmic Problem is an optimization problem, which has the nice property that several other NP-complete problems can be reduced to it in linear time. In this work, we deal with its decision version in the framework of tissue P systems. A tissue P system with cell division is a computing model which has two types of rules: communication and division rules. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to computationally hard problems in polynomial time. We here present an effective solution to Common Algorithmic Decision Problem by using a family of recognizer tissue P systems with cell division. Furthermore, a formal verification of this solution is given. |
|---|