Computational efficiency of dissolution rules in membrane systems
Trading (in polynomial time) space for time in the framework of membrane systems is not sufficient to efficiently solve computationally hard problems. On the one hand, an exponential number of objects generated in polynomial time is not sufficient to solve NP-complete problems in polynomial time. On...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2006 |
| 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/53705 |
| Acesso em linha: | http://hdl.handle.net/11441/53705 https://doi.org/10.1080/00207160601065413 |
| Access Level: | acceso abierto |
| Palavra-chave: | Computational efficiency Dissolution rules Membrane systems |
| Resumo: | Trading (in polynomial time) space for time in the framework of membrane systems is not sufficient to efficiently solve computationally hard problems. On the one hand, an exponential number of objects generated in polynomial time is not sufficient to solve NP-complete problems in polynomial time. On the other hand, when an exponential number of membranes is created and used as workspace, the situation is very different. Two operations in P systems (membrane division and membrane creation) capable of constructing an exponential number of membranes in linear time are studied in this paper. NP-complete problems can be solved in polynomial time using P systems with active membranes and with polarizations, but when electrical charges are not used, then dissolution rules turn out to be very important. We show that in the framework of P systems with active membranes but without polarizations and in the framework of P systems with membrane creation, dissolution rules play a crucial role from the computational efficiency point of view. |
|---|