Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems

Authors:
Bogdan Aman;Gabriel Ciobanu
Affiliations:
Institute of Computer Science, Romanian Academy, Iaşi, Romania and “A.I.Cuza” University, Blvd. Carol I no.11, 700506, Iaşi, Romania;Institute of Computer Science, Romanian Academy, Iaşi, Romania and “A.I.Cuza” University, Blvd. Carol I no.11, 700506, Iaşi, Romania
Venue:
Acta Informatica
Year:
2011

Citing 0
Cited 1

On the computability power of membrane systems with controlled mobility

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mutual mobile membrane systems represent a variant of mobile membrane systems in which endocytosis and exocytosis work whenever the involved membranes “agree” on the movement by using mutual complement objects placed in membranes. We provide a semi-uniform polynomial solution for a weak NP-complete problem (namely partition problem) by means of mutual mobile membrane systems.