Artículo
P systems with evolutional symport and membrane creation rules solving QSAT
Autor/es | Orellana Martín, David
![]() ![]() ![]() ![]() ![]() ![]() ![]() Valencia Cabrera, Luis ![]() ![]() ![]() ![]() ![]() ![]() ![]() Pérez Jiménez, Mario de Jesús ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2022 |
Fecha de depósito | 2022-06-30 |
Publicado en |
|
Resumen | P systems are computing devices based on sets of rules that dictate how they work.
While some of these rules can change the objects within the system, other rules can even
change the own structure, like creation rules. ... P systems are computing devices based on sets of rules that dictate how they work. While some of these rules can change the objects within the system, other rules can even change the own structure, like creation rules. They have been used in cell-like membrane systems with active membranes to efficiently solve NP-complete problems. In this work, we improve a previous result where a uniform family of P systems with evolutional communication rules whose left-hand side (respectively, right-hand side) have most 2 objects (resp., 2 objects) and membrane creation solved SAT efficiently, and we obtain an efficient solution to solve QBF-SAT or QSAT (a PSPACE-complete problem) having at most 1 object (respectively, 1 object) in their left-hand side (resp., right-hand side) and not making use of the environment |
Agencias financiadoras | Ministerio de Ciencia e Innovación (MICIN). España |
Identificador del proyecto | TIN2017-89842-P
![]() |
Cita | Orellana Martín, D., Valencia Cabrera, L. y Pérez Jiménez, M.d.J. (2022). P systems with evolutional symport and membrane creation rules solving QSAT. Theoretical Computer Science, 908 (March 2022), 56-63. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
1-s2.0-S0304397521006873-main.pdf | 315.6Kb | ![]() | Ver/ | |