A logarithmic bound for solving subset sum with P systems

Authors:
Daniel Díaz-Pernil;Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez;Agustín Riscos-Núñez
Affiliations:
University of Sevilla, Spain;University of Sevilla, Spain;University of Sevilla, Spain;University of Sevilla, Spain
Venue:
WMC'07 Proceedings of the 8th international conference on Membrane computing
Year:
2007

Citing 5
Cited 2

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
A fast P system for finding a balanced 2-partition

Soft Computing - A Fusion of Foundations, Methodologies and Applications
A linear solution of subset sum problem by using membrane creation

IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I
Attacking the common algorithmic problem by recognizer p systems

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

Formal verification of p systems with active membranes through model checking

CMC'11 Proceedings of the 12th international conference on Membrane Computing
P systems and computational algebraic topology

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of our paper is twofold. On one hand we prove the ability of polarizationless P systems with dissolution and with division rules for non-elementary membranes to solve NP-complete problems in a polynomial number of steps, and we do this by presenting a solution to the Subset Sum problem. On the other hand, we improve some similar results obtained for different models of P systems by reducing the number of steps and the necessary resources to be of a logarithmic order with respect to k (recall that n and k are the two parameters used to indicate the size of an instance of the Subset Sum problem). As the model we work with does not allow cooperative rules and does not consider the membranes to have an associated polarization, the strategy that we will follow consists on using objects to represent the weights of the subsets through their multiplicities, and comparing the number of objects against a fixed number of membranes. More precisely, we will generate k membranes in log k steps.