Uniform Solution to QSAT Using Polarizationless Active Membranes
نویسندگان
چکیده
1 Research Group on Mathematical Linguistics Rovira i Virgili University Pl. Imperial Tarraco 1, 43005 Tarragona, Spain [email protected] 2 Institute of Mathematics and Computer Science Academy of Sciences of Moldova Str. Academiei 5, Chişinău, MD 2028, Moldova [email protected] 3 Research Group on Natural Computing Department of Computer Science and Artificial Intelligence University of Sevilla Avda. Reina Mercedes s/n, 41012 Sevilla, Spain [email protected]
منابع مشابه
Uniform Solution of QSAT using Polarizationless Active Membranes
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.
متن کاملPolarizationless P Systems with Active Membranes: Computational Complexity Aspects
P systems with active membranes, in their classical definition, make use of noncooperative rules only. However, it is well known that in living cells, proteins interact among them yielding new products. Inspired by this biological phenomenon, the previous framework is reformulated in this paper, allowing cooperation in object evolution rules, while removing electrical charges associated with me...
متن کاملRemarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes
In this paper we consider three restricted variants of P systems with active membranes: (1) P systems using out communication rules only, (2) P systems using elementary membrane division and dissolution rules only, and (3) polarizationless P systems using dissolution and restricted evolution rules only. We show that every problem in P can be solved with uniform families of any of these variants...
متن کاملOn the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution
Recognizer P systems with active membranes have proven to be very powerful computing devices, being able to solve NP-complete decision problems in a polynomial time. However such solutions usually exploit many powerful features, such as electrical charges (polarizations) associated to membranes, evolution rules, communication rules, and strong or weak forms of division rules. In this paper we c...
متن کاملMinimal Parallelism and Number of Membrane Polarizations
It is known that the satisfiability problem (SAT) can be efficiently solved by a uniform family of P systems with active membranes with two polarizations working in a maximally parallel way. We study P systems with active membranes without non-elementary membrane division, working in minimally parallel way. The main question we address is what number of polarizations is sufficient for an effici...
متن کامل