Dissemin is shutting down on January 1st, 2025

Published in

Elsevier, Journal of Complexity, 3(26), p. 296-315, 2010

DOI: 10.1016/j.jco.2010.03.001

Links

Tools

Export citation

Search in Google Scholar

Computational complexity of tissue-like P systems

Journal article published in 2010 by Linqiang Pan ORCID, Mario J. Pérez Jiménez ORCID
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Membrane systems, also called P systems, are biologically inspired theoretical models of distributed and parallel computing. This paper presents a new class of tissue-like P systems with cell separation, a feature which allows the generation of new workspace. We study the efficiency of the class of P systems and draw a conclusion that only tractable problems can be efficiently solved by using cell separation and communication rules with the length of at most 1. We further present an efficient (uniform) solution to SAT by using cell separation and communication rules with length at most 6. We conclude that a borderline between efficiency and non-efficiency exists in terms of the length of communication rules (assuming ). We discuss future research topics and open problems.