Abstract
Many variants of P systems have the ability to generate an exponential number of membranes in linear time. This feature has been exploited to elaborate (theoretical) efficient solutions to \(\mathbf{NP}\)-complete, or even harder, problems. A thorough review of the existent solutions shows the utilization of common techniques and procedures. The abstraction of the latter into design patterns can serve to ease and accelerate the construction of efficient solutions to new hard problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Software design pattern, https://en.wikipedia.org/w/index.php?title=Software_design_pattern&oldid=834346932 (last visited May 10, 2018).
References
Fortnow, L., Homer, S.: A short history of computational complexity. Bull. Eur. Assoc. Theor. Comput. Sci. (EATCS) 80, 95–133 (2003)
Păun, Gh.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108–143 (2000)
Păun, Gh.: Membrane Computing. An Introduction. Natural Computing Series. Springer, Heidelberg (2002). https://doi.org/10.1007/978-3-642-56196-2
Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2009)
Păun, Gh.: P systems with active membranes: attacking NP-complete problems. J. Autom. Lang. Comb. 6(1), 75–90 (2001)
Pérez-Jiménez, M.J., Romero-Jiménez, Á., Sancho-Caparrini, F.: Complexity classes in models of cellular computing with membranes. Nat. Comput. 2(3), 265–285 (2003)
Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Jiménez, Á., Woods, D.: Complexity: membrane division, membrane creation. In: Păun et al. [4], chap. 12, pp. 302–336
Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Gutiérrez-Naranjo, M.Á., Pérez-Jiménez, M.J., Romero-Campero, F.J.: A uniform solution to SAT using membrane creation. Theor. Comput. Sci. 371(1–2), 54–61 (2007). https://doi.org/10.1016/j.tcs.2006.10.013
Pan, L., Ishdorj, T.O.: P systems with active membranes and separation rules. J. Univers. Comput. Sci. 10(5), 630–649 (2004). https://doi.org/10.3217/jucs-010-05-0630
Pérez-Jiménez, M.J., Romero-Jiménez, Á., Sancho-Caparrini, F.: A polynomial complexity class in P systems using membrane division. J. Autom. Lang. Comb. 11(4), 423–434 (2006)
Valencia-Cabrera, L., Orellana-Martín, D., Martínez-del Amor, M.Á., Riscos-Núñez, A., Pérez-Jiménez, M.J.: Reaching efficiency through collaboration in membrane systems: dissolution, polarization and cooperation. Theor. Comput. Sci. 701, 226–234 (2017). https://doi.org/10.1016/j.tcs.2017.04.015
Valencia-Cabrera, L., Orellana-Martín, D., Martínez-del Amor, M.Á., Riscos-Núñez, A., Pérez-Jiménez, M.J.: From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency. Theor. Comput. Sci. 736, 15–24 (2018). https://doi.org/10.1016/j.tcs.2017.12.012
Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: Elementary active membranes have the power of counting. Int. J. Nat. Comput. Res. 2(3), 35–48 (2011). https://doi.org/10.4018/jncr.2011070104
Leporati, A., Manzoni, L., Mauri, G., Porreca, A.E., Zandron, C.: The counting power of P systems with antimatter. Theor. Comput. Sci. 701, 161–173 (2017). https://doi.org/10.1016/j.tcs.2017.03.045
Alhazov, A., Pérez-Jiménez, M.J.: Uniform solution of, QSAT using polarizationless active membranes. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 122–133. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74593-8_11
Sosík, P.: The computational power of cell division in P systems: beating down parallel computers? Nat. Comput. 2(3), 287–298 (2003). https://doi.org/10.1023/A:1025401325428
Alhazov, A., Martín-Vide, C., Pan, L.: Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes. Fundam. Inform. 58(2), 67–77 (2003)
Acknowledgments
The authors are very grateful to Mario J. Pérez-Jiménez for his unconditional support, unlimited generosity, patience and enthusiasm, and particularly for his skillful advising and guiding as their “scientific father”.
The authors also acknowledge the support from research project TIN2017-89842-P, cofinanced by Ministerio de Economía, Industria y Competitividad (MINECO) of Spain, through the Agencia Estatal de Investigación (AEI), and by Fondo Europeo de Desarrollo Regional (FEDER) of the European Union.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Romero-Jiménez, Á., Orellana-Martín, D. (2018). Design Patterns for Efficient Solutions to NP-Complete Problems in Membrane Computing. In: Graciani, C., Riscos-Núñez, A., Păun, G., Rozenberg, G., Salomaa, A. (eds) Enjoying Natural Computing. Lecture Notes in Computer Science(), vol 11270. Springer, Cham. https://doi.org/10.1007/978-3-030-00265-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-00265-7_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00264-0
Online ISBN: 978-3-030-00265-7
eBook Packages: Computer ScienceComputer Science (R0)