Mostrar el registro sencillo del ítem

Artículo

dc.creatorGutiérrez Naranjo, Miguel Ángeles
dc.creatorPérez Jiménez, Mario de Jesúses
dc.creatorRomero Campero, Francisco Josées
dc.date.accessioned2017-12-22T10:46:28Z
dc.date.available2017-12-22T10:46:28Z
dc.date.issued2007
dc.identifier.citationGutiérrez Naranjo, M.Á., Pérez Jiménez, M.d.J. y Romero Campero, F.J. (2007). A uniform solution to SAT using membrane creation. Theoretical Computer Science, 371 (1-2), 54-61.
dc.identifier.issn0304-3975es
dc.identifier.urihttp://hdl.handle.net/11441/67988
dc.description.abstractIn living cells, new membranes are produced basically through two processes: mitosis and autopoiesis. These two processes have inspired two variants of cell-like membrane systems, namely P systems with active membranes and P systems with membrane creation. In this paper, we provide the first u niform, e fficient so lution to th e SAT pr oblem in th e fr amework of re cogniser P systems with membrane creation using dissolution rules. Recently the authors have proved that if the dissolution rules are not allowed to be used, then the polynomial complexity class associated with this variant of P systems is the standard complexity class P. This result, together with the main result of this paper, shows the surprising role of the apparently “innocent” operation of membrane dissolution. The use of this type of rule establishes the difference between efficiency and non-efficiency for P systems with membrane creation, and provides a barrier between P and NP (assuming P 6= NP).es
dc.description.sponsorshipMinisterio de Ciencia y Tecnología TIC2002-04220-C03-01es
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherElsevieres
dc.relation.ispartofTheoretical Computer Science, 371 (1-2), 54-61.
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectNatural computinges
dc.subjectMembrane Computinges
dc.subjectCellular complexity classeses
dc.subjectSAT problemes
dc.titleA uniform solution to SAT using membrane creationes
dc.typeinfo:eu-repo/semantics/articlees
dcterms.identifierhttps://ror.org/03yxnpp24
dc.type.versioninfo:eu-repo/semantics/submittedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificiales
dc.relation.projectIDTIC2002-04220-C03-01es
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0304397506007651?via%3Dihubes
dc.identifier.doi10.1016/j.tcs.2006.10.013es
dc.contributor.groupUniversidad de Sevilla. TIC193: Computación Naturales
idus.format.extent8es
dc.journaltitleTheoretical Computer Sciencees
dc.publication.volumen371es
dc.publication.issue1-2es
dc.publication.initialPage54es
dc.publication.endPage61es
dc.identifier.sisius6651353es
dc.contributor.funderMinisterio de Ciencia y Tecnología (MCYT). España

FicherosTamañoFormatoVerDescripción
af35814de1e0327efaca998447f5a5 ...298.2KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional