Complexity aspects of polarizationless membrane systems

Authors:
Alberto Leporati;Claudio Ferretti;Giancarlo Mauri;Mario J. Pérez-Jiménez;Claudio Zandron
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano---Bicocca, Milan, Italy I-20126;Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano---Bicocca, Milan, Italy I-20126;Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano---Bicocca, Milan, Italy I-20126;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain 41012;Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano---Bicocca, Milan, Italy I-20126
Venue:
Natural Computing: an international journal
Year:
2009

Citing 12
Cited 3

P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Computing with Membranes: Attacking NP-Complete Problems

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Solving NP-Complete Problems Using P Systems with Active Membranes

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Computing with Membranes

Computing with Membranes
The computational power of cell division in P systems: Beating down parallel computers?

Natural Computing: an international journal
A fast P system for finding a balanced 2-partition

Soft Computing - A Fusion of Foundations, Methodologies and Applications
P systems with minimal parallelism

Theoretical Computer Science
On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution

Fundamenta Informaticae
On the power of dissolution in p systems with active membranes

WMC'05 Proceedings of the 6th international conference on Membrane Computing
Attacking the common algorithmic problem by recognizer p systems

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Selected topics in computational complexity of membrane systems

Computation, cooperation, and life
A Σ2P∪ Π2Plower bound using mobile membranes

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
A computational complexity theory in membrane computing

WMC'09 Proceedings of the 10th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate polarizationless P systems with active membranes working in maximally parallel manner, which do not make use of evolution or communication rules, in order to find which features are sufficient to efficiently solve computationally hard problems. We show that such systems are able to solve the PSPACE-complete problem Quantified 3-sat, provided that non-elementary membrane division is controlled by the presence of a (possibly non-elementary) membrane.