%0 Generic
%D 2007
%T A logarithmic bound for solving Subset Sum with P systems
%A Daniel Díaz-Pernil
%A Miguel A. Gutiérrez-Naranjo
%A Mario J. Pérez-Jiménez
%A Agustín Riscos-Núñez
%C Amsterdam, The Netherlands
%I Springer
%P 257-270
%R 10.1007/978-3-540-77312-2_16
%U http://www.springerlink.com/content/tq37h93l8p454153/
%X 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 logk steps.
%Z In G. Elefterakis, P. Kefalas, Gh. Paun, G. Rozenberg, A. Salomaa (eds.)
Revised, Selected, and Invited Papers. Lecture Notes in Computer Science, Springer-Verlag, Berlin-Heidelberg, 4860 (2007), 257-270
%8 June 25-28, 2007
%@ 978-3-540-77311-5