4.2 Article

Solving the subset-sum problem by P systems with active membranes

Journal

NEW GENERATION COMPUTING
Volume 23, Issue 4, Pages 339-356

Publisher

SPRINGER
DOI: 10.1007/BF03037637

Keywords

membrane computing; complexity classes; active membranes; subset-sum problem

Ask authors/readers for more resources

We present the first membrane computing solution to the Subset-Sum problem using a family of deterministic P systems with active membranes. We do not use priority among rules, membrane dissolution nor cooperation; it suffices to control the electrical charges of the membranes and to introduce some counters. The number of steps of any computation is of the linear order (but it is necessary a polynomial-time of precomputed resources).

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available