Mostrar el registro sencillo del ítem

Ponencia

dc.creatorPorreca, Antonio E.es
dc.creatorLeporati, Albertoes
dc.creatorMauri, Giancarloes
dc.creatorZandron, Claudioes
dc.date.accessioned2016-03-30T08:25:09Z
dc.date.available2016-03-30T08:25:09Z
dc.date.issued2010
dc.identifier.isbn9788461423576es
dc.identifier.urihttp://hdl.handle.net/11441/39113
dc.description.abstractWe identify a family of decision problems that are hard for some complexity classes defined in terms of P systems with active membranes working in polynomial time. Furthermore, we prove the completeness of these problems in the case where the systems are equipped with a form of priority that linearly orders their rules. Finally, we highlight some possible connections with open problems related to the computational complexity of P systems with active membranes.es
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherFénix Editoraes
dc.relation.ispartofProceedings of the Eighth Brainstorming Week on Membrane Computing, 243-253. Sevilla, E.T.S. de Ingeniería Informática, 1-5 de Febrero, 2010es
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleComplete Problems for a Variant of P Systems with Active Membraneses
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/39113

FicherosTamañoFormatoVerDescripción
19Porreca.pdf171.8KbIcon   [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