A linear solution of subset sum problem by using membrane creation

Authors:
M. A. Gutiérrez-Naranjo;M. J. Pérez-Jiménez;F. J. Romero-Campero
Affiliations:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain
Venue:
IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I
Year:
2005

Citing 3
Cited 2

Computing with membranes

Journal of Computer and System Sciences
The power of communication: P systems with symport/antiport

New Generation Computing
A fast P system for finding a balanced 2-partition

Soft Computing - A Fusion of Foundations, Methodologies and Applications

A logarithmic bound for solving subset sum with P systems

WMC'07 Proceedings of the 8th international conference on Membrane computing
A linear solution for QSAT with membrane creation

WMC'05 Proceedings of the 6th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Membrane Computing is a branch of Natural Computing which starts from the assumption that the processes taking place in the compartmental structure of a living cell can be interpreted as computations. In this framework, the solution of NP problems is obtained by generating an exponential amount on workspace in polynomial time and using parallelism to check simultaneously all the candidates to solution. We present a solution to the Subset Sum problem for P systems where new membranes are generated from objects.