dc.creator | Porreca, Antonio E. | es |
dc.creator | Leporati, Alberto | es |
dc.creator | Mauri, Giancarlo | es |
dc.creator | Zandron, Claudio | es |
dc.date.accessioned | 2016-03-30T08:25:09Z | |
dc.date.available | 2016-03-30T08:25:09Z | |
dc.date.issued | 2010 | |
dc.identifier.isbn | 9788461423576 | es |
dc.identifier.uri | http://hdl.handle.net/11441/39113 | |
dc.description.abstract | We 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.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Fénix Editora | es |
dc.relation.ispartof | Proceedings of the Eighth Brainstorming Week on Membrane Computing, 243-253. Sevilla, E.T.S. de Ingeniería Informática, 1-5 de Febrero, 2010 | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | Complete Problems for a Variant of P Systems with Active Membranes | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessrights | info:eu-repo/semantics/openAccess | |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/39113 | |