Mostra el registre d'ítem simple

dc.contributor.authorRius Font, Miquel
dc.contributor.authorGutiérrez Escudero, Rosa
dc.contributor.authorPérez Jiménez, Mario J.
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned2012-09-25T12:13:20Z
dc.date.created2010
dc.date.issued2010
dc.identifier.citationRius, M.; Gutiérrez, R.; Pérez, M. Characterizing tractability by tissue-like P-systems. A: "Lecture Notes in Computer Science". Springer, 2010, p. 289-300.
dc.identifier.isbn13 978-3-642-11466-3
dc.identifier.urihttp://hdl.handle.net/2117/16563
dc.description.abstractIn the framework of recognizer cell–like membrane systems it is well known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP–complete problems. Nonetheless, it may be sufficient to create an exponential number of membranes in polynomial time. In this paper, we study the computational efficiency of recognizer tissue P systems with communication (symport/antiport) rules and division rules. Some results have been already obtained in this direction: (a) using communication rules and making no use of division rules, only tractable problems can be efficiently solved; (b) using communication rules with length three and division rules, NP–complete problems can be efficiently solved. In this paper, we show that the length of communication rules plays a relevant role from the efficiency point of view for this kind of P systems.
dc.format.extent12 p.
dc.language.isoeng
dc.publisherSpringer
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshComputational complexity
dc.subject.lcshComputer algorithms
dc.subject.lcshApproximation theory
dc.subject.lcshPolynomials
dc.titleCharacterizing tractability by tissue-like P-systems
dc.typePart of book or chapter of book
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.identifier.doi10.1007/978-3-642-11467-0
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.springerlink.com/content/nh2468578127/#section=653644&page=1
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac9460885
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
local.citation.authorRius, M.; Gutiérrez, R.; Pérez, M.
local.citation.publicationNameLecture Notes in Computer Science
local.citation.startingPage289
local.citation.endingPage300


Fitxers d'aquest items

Imatge en miniatura

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple