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

Authors:
Claudio Zandron;Alberto Leporati;Claudio Ferretti;Giancarlo Mauri;Mario J. Pérez-Jiménez
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, Viale Sarca 336/14, 20126 Milano, Italy. {zandron,leporati,ferretti,mauri}@disco.unimib. ...;(Correspd.) Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, Viale Sarca 336/14, 20126 Milano, Italy. {zandron,leporati,ferretti,mauri}@d ...;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, Viale Sarca 336/14, 20126 Milano, Italy. {zandron,leporati,ferretti,mauri}@disco.unimib. ...;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, Viale Sarca 336/14, 20126 Milano, Italy. {zandron,leporati,ferretti,mauri}@disco.unimib. ...;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012 Sevilla, Spain. marper@us.es
Venue:
Fundamenta Informaticae
Year:
2008

Citing 12
Cited 0

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
A guide to membrane computing

Theoretical Computer Science - Natural computing
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
On a Păun's Conjecture in Membrane Systems

IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
On the power of dissolution in p systems with active membranes

WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the efficiency of p systems with active membranes and two polarizations

WMC'04 Proceedings of the 5th 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recognizer P systems with active membranes have proven to be very efficient computing devices, being able to solve NP-complete decision problems in a polynomial time. However such solutions usually exploit many powerful features, such as electrical charges (polarizations) associated to membranes, evolution rules, communication rules, and strong or weak forms of division rules. In this paper we contribute to the study of the computational power of polarizationless recognizer P systems with active membranes. Precisely, we show that such systems are able to solve in polynomial time the NP-complete decision problem 3-SAT by using only dissolution rules and a form of strong division for non-elementary membranes, working in the maximallly parallel way.