Computational Complexity of Simple P Systems

Authors:
Gabriel Ciobanu;Andreas Resios
Affiliations:
(Correspd.) Romanian Academy, Institute of Computer Science "A.I.Cuza" University of Iaşi Blvd. Carol I no.11, 700506 Iaşi, Romania. gabriel@iit.tuiasi.ro;Romanian Academy, Institute of Computer Science "A.I.Cuza" University of Iaşi Blvd. Carol I no.11, 700506 Iaşi, Romania. gabriel@iit.tuiasi.ro
Venue:
Fundamenta Informaticae
Year:
2008

Citing 7
Cited 2

Introduction to algorithms

Introduction to algorithms
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
Applications of Membrane Computing (Natural Computing Series)

Applications of Membrane Computing (Natural Computing Series)
Solving numerical NP-complete problems with spiking neural P systems

WMC'07 Proceedings of the 8th international conference on Membrane computing
On descriptive complexity of p systems

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

Complexity of evolution in maximum cooperative P systems

Natural Computing: an international journal
Evolving by maximizing the number of rules: complexity study

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new class of membrane systems called simple P systems, and studies their computational complexity. We start by presenting the knapsack problem and its time complexity. Then we study the computational complexity of simple P systems by considering the allocation of resources enabling the parallel application of the rules. We show that the decision version of the resource allocation problem for simple P systems is NP-complete, by using the knapsack problem.