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 logk steps.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alhazov, A., Freund, R., Păun, G.: P Systems with Active Membranes and Two Polarizations. In: Păun, G., Riscos-Núñez, A., Romero-Jiménez, A., Sancho-Caparrini, F. (eds.) Proc. Second Brainstorming Week on Membrane Computing, Report RGNC 01/04, pp. 20–35 (2004)
Díaz-Pernil, D., Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A.: Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division. LNCS, vol. 4527, pp. 170–179 (2007)
Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Campero, F.J.: Computational Efficiency of Dissolution Rules in Membrane Systems. International Journal of Computer Mathematics 83(7), 593–611 (2006)
Gutiérrez Naranjo, M.A., Pérez Jiménez, M.J., Romero-Campero, F.J.: A Linear Solution of Subset Sum Problem by Using Membrane Creation. In: Mira, J.M., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3561, pp. 258–267. Springer, Heidelberg (2005)
Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A.: A Fast P System for Finding a Balanced 2-Partition. Soft Computing 9(9), 673–678 (2005)
Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Campero, F.: On the Power of Dissolution in P Systems with Active Membranes. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 373–394. Springer, Heidelberg (2006)
Păun, G.: Computing with Membranes: Attacking NP–complete Problems. In: Antoniou, I., Calude, C., Dinneen, M.J. (eds.) UMC 2000. Unconventional Models of Computation, pp. 94–115. Springer, Berlin (2000)
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Pérez-Jiménez, M.J., Riscos-Núñez, A.: Solving the Subset-Sum problem by P Systems with Active Membranes. New Generation Computing 23(4), 367–384 (2005)
Pérez-Jiménez, M.J., Riscos-Núñez, A.: A Linear–time Solution to the Knapsack Problem Using P Systems with Active Membranes. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) Membrane Computing. LNCS, vol. 2933, pp. 250–268. Springer, Heidelberg (2004)
Pérez-Jiménez, M.J., Romero-Campero, F.J.: Solving the Bin Packing Problem by Recognizer P Systems with Active Membranes. In: Păun, G., Riscos-Núñez, A., Romero-Jiménez, A., Sancho-Caparrini, F. (eds.) Proc. Second Brainstorming Week on Membrane Computing, Report RGNC 01/04, University of Seville, pp. 414–430 (2004)
Pérez-Jiménez, M.J., Romero–Campero, F.J.: Attacking the Common Algorithmic Problem by Recognizer P Systems. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 304–315. Springer, Heidelberg (2005)
Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: A Polynomial Complexity Class in P Systems Using Membrane Division. In: DCFS 2003. Proc. 5th Workshop on Descriptional Complexity of Formal Systems, pp. 284–294 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Díaz-Pernil, D., Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A. (2007). A Logarithmic Bound for Solving Subset Sum with P Systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2007. Lecture Notes in Computer Science, vol 4860. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77312-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-77312-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77311-5
Online ISBN: 978-3-540-77312-2
eBook Packages: Computer ScienceComputer Science (R0)