Mostrar el registro sencillo del ítem
Artículo
From SAT to SAT-UNSAT using P systems with dissolution rules
dc.creator | Riscos Núñez, Agustín | es |
dc.creator | Valencia Cabrera, Luis | es |
dc.date.accessioned | 2022-07-01T10:25:55Z | |
dc.date.available | 2022-07-01T10:25:55Z | |
dc.date.issued | 2022 | |
dc.identifier.citation | Riscos Núñez, A. y Valencia Cabrera, L. (2022). From SAT to SAT-UNSAT using P systems with dissolution rules. Journal of membrane computing, April 2022 | |
dc.identifier.issn | 2523-8914 | es |
dc.identifier.uri | https://hdl.handle.net/11441/134910 | |
dc.description.abstract | DP is the class of problems that are the differences between two languages from NP. Most difficult problems from DP are called DP-complete problems, that can be seen as the conjunction of an NP-complete problem and a co-NP-complete problem. It is easy to see that the problem P vs NP is equivalent to the problem P vs DP, and therefore DP-complete problems would be better candidates to attack the conjecture, since they seem to be harder than NP-complete problems. In this paper, a methodology to transform an efficient solution of an NP-complete problem into an efficient solution of a DP-complete problem is applied. More precisely, a solution to SAT is given by means of a uniform family of recognizer polarizationless P systems with active membranes with dissolution rules and division rules for both elementary and non-elementary membranes, and later it is transformed into a solution to the problem SAT-UNSAT. | es |
dc.description.sponsorship | Ministerio de Ciencia e Innovación TIN2017-89842-P | es |
dc.format | application/pdf | es |
dc.format.extent | 10 | es |
dc.language.iso | eng | es |
dc.publisher | Springer | es |
dc.relation.ispartof | Journal of membrane computing, April 2022 | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Complexity class DP | es |
dc.subject | Membrane computing | es |
dc.subject | Product problem | es |
dc.subject | Satisfability problem | es |
dc.title | From SAT to SAT-UNSAT using P systems with dissolution rules | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial | es |
dc.relation.projectID | TIN2017-89842-P | es |
dc.relation.publisherversion | https://link.springer.com/article/10.1007/s41965-022-00095-5 | es |
dc.identifier.doi | 10.1007/s41965-022-00095-5 | es |
dc.contributor.group | Universidad de Sevilla. TIC193 : Computación Natural | es |
dc.journaltitle | Journal of membrane computing | es |
dc.publication.issue | April 2022 | es |
dc.contributor.funder | Ministerio de Ciencia e Innovación (MICIN). España | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Riscos-Núñez-Valencia-Cabrera2 ... | 1.545Mb | ![]() | Ver/ | |