Characterizing tractability by cell-like membrane systems
In this paper we present a polynomial complexity class in the framework of membrane computing. In this context, and using accepting transition P systems, we provide a characterization of the standard computational class P of problems solvable in polynomial time by deterministic Turing machines.
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2006 |
| 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/157099 |
| Acceso en línea: | https://hdl.handle.net/11441/157099 |
| Access Level: | acceso abierto |
| Palabra clave: | Membrane computing P systems |
| Sumario: | In this paper we present a polynomial complexity class in the framework of membrane computing. In this context, and using accepting transition P systems, we provide a characterization of the standard computational class P of problems solvable in polynomial time by deterministic Turing machines. |
|---|