Characterizing Tractability by Tissue-Like P Systems

  • Rosa Gutiérrez–Escudero
  • Mario J. Pérez–Jiménez
  • Miquel Rius–Font
Conference paper

DOI: 10.1007/978-3-642-11467-0_21

Volume 5957 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Gutiérrez–Escudero R., Pérez–Jiménez M.J., Rius–Font M. (2010) Characterizing Tractability by Tissue-Like P Systems. In: Păun G., Pérez-Jiménez M.J., Riscos-Núñez A., Rozenberg G., Salomaa A. (eds) Membrane Computing. WMC 2009. Lecture Notes in Computer Science, vol 5957. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Rosa Gutiérrez–Escudero
    • 1
  • Mario J. Pérez–Jiménez
    • 1
  • Miquel Rius–Font
    • 2
  1. 1.Research Group on Natural Computing, Department of Computer Science and Artificial IntelligenceUniversity of SevillaSevillaSpain
  2. 2.Department of Applied Mathematics IVUniversitat Politécnica de CatalunyaCastelldefelsSpain