Abstract
We prove that a uniform family of P systems with active membranes, where division rules only operate on elementary membranes and dissolution rules are avoided, can be used to solve the following PP-complete decision problem in polynomial time: given a Boolean formula of m variables in 3CNF, do at least √2m among the 2 m possible truth assignments satisfy it? As a consequence, the inclusion PP ⊆ PMCAM(-d,-n) holds: this provides an improved lower bound on the class of languages decidable by this kind of P systems. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Porreca, A. E., Leporati, A., Mauri, G., & Zandron, C. (2010). P systems with elementary active membranes: Beyond NP and coNP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6501 LNCS, pp. 338–347). Springer Verlag. https://doi.org/10.1007/978-3-642-18123-8_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
