Abstract
Membrane computing is a formal framework of distributed parallel multiset processing. Due to massive parallelism and exponential space some intractable computational problems can be solved by P systems with active membranes in a polynomial number of steps. In this paper we generalize this approach from decisional problems to the computational ones, by providing a solution of a #P-complete problem, namely to compute the permanent of a binary matrix. The implication of this result to the PP complexity class is discussed and compared to known results about NP ∪ co − NP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alhazov, A., Pan, L., Păun, G.: Trading polarizations for labels in P systems with active membranes. Acta Informaticae 41, 111–144 (2004)
Gill, J.: Computational complexity of probabilistic Turing machines. SIAM Journal on Computing 6, 675–695 (1977)
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, 673–678 (2005)
Păun, G.: P systems with active membranes: Attacking NP–complete problems. J. Automata, Languages and Combinatorics 6, 75–90 (2001)
Păun, G., Suzuki, Y., Tanaka, H., Yokomori, T.: On the power of membrane division in P systems. Theoretical Computer Sci. 324, 61–85 (2004)
Pérez-Jiménez, M.J., Riscos-Núñez, A.: Solving the subset-sum problem by active membranes. New Generation Computing 23, 367–384 (2005)
Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Complexity classes in cellular computing with membranes. Natural Computing 2, 265–285 (2003)
Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Computationally hard problems addressed through P systems. In: Ciobanu, G., et al. (eds.) Applications of Membrane Computing, pp. 315–346. Springer, Heidelberg (2006)
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)
Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Sci. 8, 189–201 (1979)
Wegener, I.: Complexity Theory: Exploring the Limits of Efficient Algorithms. Springer, Heidelberg (2005)
Williams, R.M., Wood, D.H.: Exascale computer algebra problems interconnect with molecular reactions and complexity theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Sci. 44, 267–275 (1999)
http://en.wikipedia.org/wiki/Permanent (updated 05.05.2008)
http://en.wikipedia.org/wiki/PP_complexity (updated 09.09.2008)
http://en.wikipedia.org/wiki/Sharp-P (updated 13.12.2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alhazov, A., Burtseva, L., Cojocaru, S., Rogozhin, Y. (2009). Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes. In: Corne, D.W., Frisco, P., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2008. Lecture Notes in Computer Science, vol 5391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95885-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-95885-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-95884-0
Online ISBN: 978-3-540-95885-7
eBook Packages: Computer ScienceComputer Science (R0)