<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Orellana-Martín</style></author><author><style face="normal" font="default" size="100%">Ramírez-de-Arellano, Antonio</style></author><author><style face="normal" font="default" size="100%">Andreu-Guzmán, José Antonio</style></author><author><style face="normal" font="default" size="100%">Álvaro Romero-Jiménez</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Protocol for Solutions to DP-Complete Problems through Tissue Membrane Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Mathematics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2023</style></year><pub-dates><date><style  face="normal" font="default" size="100%">06/2023</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.mdpi.com/2227-7390/11/13/2797</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">13</style></number><edition><style face="normal" font="default" size="100%">13</style></edition><publisher><style face="normal" font="default" size="100%">MDPI</style></publisher><volume><style face="normal" font="default" size="100%">11</style></volume><pages><style face="normal" font="default" size="100%">2797</style></pages><abstract><style face="normal" font="default" size="100%">Considering a class&amp;nbsp;R&amp;nbsp;comprising recognizer membrane systems with the capability of providing polynomial-time and uniform solutions for NP-complete problems (referred to as a &amp;ldquo;presumably efficient&amp;rdquo; class), the corresponding polynomial-time complexity class PMCR&amp;nbsp;encompasses both the NP and&amp;nbsp;co-NP&amp;nbsp;classes. Specifically, when&amp;nbsp;R&amp;nbsp;represents the class of recognizer presumably efficient cell-like P systems that incorporate object evolution rules, communication rules, and dissolution rules, PMCR&amp;nbsp;includes both the DP and&amp;nbsp;co-DP&amp;nbsp;classes. Here, DP signifies the class of languages that can be expressed as the difference between any two languages in NP (it is worth noting that NP &amp;sube; DP and&amp;nbsp;co-NP&amp;sube;co-DP). As DP-complete problems are believed to be more complex than NP-complete problems, they serve as promising candidates for studying the P vs. NP problem. This outcome has previously been established within the realm of recognizer P systems with active membranes. In this paper, we extend this result to encompass any class&amp;nbsp;R&amp;nbsp;of presumably efficient recognizer tissue-like membrane systems by presenting a detailed protocol for transforming solutions of NP-complete problems into solutions of DP-complete problems.</style></abstract></record></records></xml>