Cooperative P Systems and the P Versus NP Problem
The P versus NP problem is undoubtedly the most important open question in computer science. Frontiers of tractability or efficiency expressed by means of syntactic or semantic ingredients in the framework of Membrane Computing, an unconventional computing paradigm, can bring a new approach to tackl...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2017 |
| 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/127678 |
| Acceso en línea: | https://hdl.handle.net/11441/127678 |
| Access Level: | acceso abierto |
| Palabra clave: | Membrane computing P systems with active membranes Cooperative rules the P versus NP problem SAT problem |
| Sumario: | The P versus NP problem is undoubtedly the most important open question in computer science. Frontiers of tractability or efficiency expressed by means of syntactic or semantic ingredients in the framework of Membrane Computing, an unconventional computing paradigm, can bring a new approach to tackle P versus NP. In this context, the role of the cooperation of objects to trigger rewriting rules is analysed in order to obtain this kind of borderlines. Besides, a relationship among cooperative rewriting rules and instances of 2–SAT problem and 3–SAT problem is highlighted and their connections with results of computational complexity theory are described |
|---|