Mostra el registre d'ítem simple
Characterizing tractability by tissue-like P-systems
dc.contributor.author | Rius Font, Miquel |
dc.contributor.author | Gutiérrez Escudero, Rosa |
dc.contributor.author | Pérez Jiménez, Mario J. |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2012-09-25T12:13:20Z |
dc.date.created | 2010 |
dc.date.issued | 2010 |
dc.identifier.citation | Rius, 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.isbn | 13 978-3-642-11466-3 |
dc.identifier.uri | http://hdl.handle.net/2117/16563 |
dc.description.abstract | In 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.extent | 12 p. |
dc.language.iso | eng |
dc.publisher | Springer |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Computational complexity |
dc.subject.lcsh | Computer algorithms |
dc.subject.lcsh | Approximation theory |
dc.subject.lcsh | Polynomials |
dc.title | Characterizing tractability by tissue-like P-systems |
dc.type | Part of book or chapter of book |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.identifier.doi | 10.1007/978-3-642-11467-0 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://www.springerlink.com/content/nh2468578127/#section=653644&page=1 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 9460885 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Rius, M.; Gutiérrez, R.; Pérez, M. |
local.citation.publicationName | Lecture Notes in Computer Science |
local.citation.startingPage | 289 |
local.citation.endingPage | 300 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Capítols de llibre [200]
-
Capítols de llibre [22]