Characterizing tractability by tissue-like p systems

Authors:
Rosa Gutiérrez–Escudero;Mario J. Pérez–Jiménez;Miquel Rius–Font
Affiliations:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Department of Applied Mathematics IV, Universitat Politécnica de Catalunya, Castelldefels, Spain
Venue:
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Year:
2009

Citing 9
Cited 2

Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport

New Generation Computing
Simulating Counter Automata by P Systems with Symport/Antiport

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Tissue P systems

Theoretical Computer Science
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
Efficient simulation of tissue-like P systems by transition cell-like P systems

Natural Computing: an international journal
A polynomial complexity class in P systems using membrane division

Journal of Automata, Languages and Combinatorics
On the power of dissolution in p systems with active membranes

WMC'05 Proceedings of the 6th international conference on Membrane Computing

Tissue p systems with cell separation: upper bound by PSPACE

TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
Limits of the power of tissue p systems with cell division

CMC'12 Proceedings of the 13th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

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.