Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
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.
Unable to display preview. Download preview PDF.
- 8.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)Google Scholar
- 13.http://en.wikipedia.org/wiki/Permanent (updated 05.05.2008)
- 14.http://en.wikipedia.org/wiki/PP_complexity (updated 09.09.2008)
- 15.http://en.wikipedia.org/wiki/Sharp-P (updated 13.12.2007)