2021-04-262021-04-262018Orellana Martín, D., Valencia Cabrera, L., Riscos Núñez, A. y Pérez Jiménez, M.d.J. (2018). The Unique Satisfiability Problem from a Membrane Computing Perspective. Romanian Journal of Information Science and Technology (ROMJIST), 21 (3), 288-297.1453-8245https://hdl.handle.net/11441/107738Complexity class DP is the class of “differences” of any two languages in NP. It verifies that NP[ co-NP DP PNP, where PNP is the second level of the polynomial hierarchy, specifically, it is the class of languages decidable by a deterministic polynomial-time Turing machine having access to an NP oracle. The unique sastifiability problem (UNIQUE SAT) is a well known DP problem which has been proved to be co-NPhard. In this paper, a uniform and polynomial time solution for the UNIQUE SAT problem is given by a family of polarizationless P systems with active membranes and division rules only for elementary membranes, without dissolution rules but using minimal cooperation and minimal production in object evolution rules.application/pdf10engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Complexity class DPPolarizationless P systems with active membranesCooperative rulesUNIQUE SAT probleminfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess