Show simple item record

dc.creatorValencia Cabrera, Luis
dc.creatorSong, Bosheng
dc.creatorMacías Ramos, Luis Felipe
dc.creatorPan, Linqiang
dc.creatorRiscos Núñez, Agustín
dc.creatorPérez Jiménez, Mario de Jesús
dc.date.accessioned2016-01-22T08:47:41Z
dc.date.available2016-01-22T08:47:41Z
dc.date.issued2015
dc.identifier.isbn978-84-944366-2-8es
dc.identifier.urihttp://hdl.handle.net/11441/33124
dc.description.abstractMembrane ssion is a process by which a biological membrane is split into two new ones in such a way that the contents of the initial membrane is separated and distributed between the new membranes. Inspired by this biological phenomenon, membrane separation rules were considered in membrane computing. In this paper we deal with celllike P systems with membrane separation rules that use symport/antiport rules (such systems compute by changing the places of objects with respect to the membranes, and not by changing the objects themselves) as communication rules. Speci cally we study a lower bound on the length of communication rules with respect to the computational e ciency of such kind of membrane systems; that is, their ability to solve computationally hard problems in polynomial time by trading space for time. The main result of this paper is the following: communication rules involving at most three objects is enough to achieve the computational e ciency of P systems with membrane separation. Thus, a polynomial time solution to SAT problem is provided in this computing framework. It is known that only problems in P can be solved in polynomial time by using minimal cooperation in communication rules and membrane separation, so the lower bound of the e ciency obtained is an optimal bound.es
dc.description.sponsorshipMinisterio de Economía y Competitividad TIN2012-37434
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherFénix Editoraes
dc.relation.ispartofProceedings of the Thirteenth Brainstorming Week on Membrane Computing, 325-370. Sevilla, E.T.S. de Ingeniería Informática, 2-6 de Febrero, 2015,es
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleComputational Efficiency of P Systems with Symport/Antiport Rules and Membrane Separationes
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificiales
dc.relation.projectIDinfo:eu-repo/grantAgreement/MINECO/TIN2012-37434
dc.contributor.groupUniversidad de Sevilla. TIC193: Computación Natural
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/33124
dc.contributor.funderMinisterio de Economía y Competitividad (MINECO). España

FilesSizeFormatViewDescription
325_comp-eff-sym-ant-sep.pdf475.0KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional