A Σ2P∪ Π2Plower bound using mobile membranes

Authors:
Shankara Narayanan Krishna;Gabriel Ciobanu
Affiliations:
IIT Bombay, Powai, Mumbai, India;Romanian Academy, Institute of Computer Science and A.I.Cuza University of Iasi, Romania
Venue:
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Year:
2011

Citing 13
Cited 1

Computing with membranes

Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
Further remarks on P systems with active membranes, separation, merging, and release rules

Soft Computing - A Fusion of Foundations, Methodologies and Applications
On the Computational Power of Enhanced Mobile Membranes

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution

Fundamenta Informaticae
Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes

Membrane Computing
Complexity aspects of polarizationless membrane systems

Natural Computing: an international journal
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
P systems with elementary active membranes: beyond NP and coNP

CMC'10 Proceedings of the 11th international conference on Membrane computing
Enhanced Mobile Membranes: Computability Results

Theory of Computing Systems
On the efficiency of p systems with active membranes and two polarizations

WMC'04 Proceedings of the 5th international conference on Membrane Computing
Trading polarization for bi-stable catalysts in p systems with active membranes

WMC'04 Proceedings of the 5th international conference on Membrane Computing

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

One of the interesting applications of membrane computing is the ability to solve intractable problems in polynomial time. The existing variants with active membranes have several powerful features like polarizations, dissolution, evolution and communication rules as well as non-elementary membrane division. We propose a simple variant which uses elementary membrane division and communication only in the form of mobility of membranes. We show that this variant has Σ2P ∩ Π2P as lower bound. This is the first known treatment of the complexity classes SP Σ2P, Π2P using active membranes without the features of polarizations, non elementary membrane division.