Abstract
It is known that the satisfiability problem (SAT) can be solved with a semi-uniform family of deterministic polarizationless P systems with active membranes with non-elementary membrane division. We present a double improvement of this result by showing that the satisfiability of a quantified Boolean formula (QSAT) can be solved by a uniform family of P systems of the same kind. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Alhazov, A., & Pérez-Jiménez, M. J. (2007). Uniform solution of QSAT using polarizationless active membranes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4664 LNCS, pp. 122–133). Springer Verlag. https://doi.org/10.1007/978-3-540-74593-8_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
