Abstract
A recently introduced variant of P-systems considers membranes which can multiply by division. These systems use two types of division: division for elementary membranes (Le. membranes not containing other membranes inside) and division for non-elementary membranes. In two recent papers it is shown how to solve the Satisfiability problem and the Hamiltonian Path problem (two well known NP complete problems) in linear time with respect to the input length, using both types of division. We show in this paper that P-systems with only division for elementary membranes suffice to solve these two problems in linear time. Is it possible to solve NP complete problems in polynomial time using P-systems without membrane division? We show, moreover, that (if P ≠ NP) deterministic P-systems without membrane division are not able to solve NP complete problems in polynomial time.
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
J. Dassow, Gh. Paun, On the power of membrane computing, J. Univ. Computer Sci., 5, 2 (1999),33–49.
S. N. Krishna, R. Rama, A variant of P-systems with active membranes: Solving NP-complete problems, Romanian J. of Information Science and Technology, 2, 4 (1999).
Gh. Paun, P-systems with active membranes: attacking NP complete problems, submitted 1999 (see also CDMTCS Research report No. 102, 1999, Auckland Univ., New Zealand, (www.cs.auckland.ac.nz/CDMTCS)
Gh Paun, Computing with membranes. An introduction, Bulletin of the EATCS, 67 (Febr. 1999), 139–152.
Gh. Paun, Computing with membranes, J. of Computer and System Sciences, in press (see also TUCS Research Report No 208, November 1998 http://www.tucs.fi).
Gh. Paun, Computing with membranes. A variant, J. of Computer and System Sciences, 11,167–,2000 (see also CDMTCS Report No. 0.98, 1999, of CS Department, Auckland Univ., New Zealand, (www.cs.auckland.ac.nz/CDMTCS).
Gh. Paun, G. Rozenberg, A. Salomaa, Membrane computing with external output, Fundamenta Informaticae, 41, 3, 2000 (see also TUCS Research Report No. 218, December 1998, http://www.tucs.fi).
Gh. Paun, S. Yu, On synchronization in P-systems, Fundamenta Informaticae, 38, 4 (1999),397–410 (see also CS Department TR No 539, Univ. of Western Ontario, London, Ontario, 1999, www.csd.uwo.ca/faculty/syu/TR539.html).
Gh. Paun, Computing with membrane (P-systems): Twenty-six research topics, Research Report, 2000.
I. Petre, A normal form for P-systems, Bulletin of EATCS, 67 (Febr. 1999), 165–172.
G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London
About this paper
Cite this paper
Zandron, C., Ferretti, C., Mauri, G. (2001). Solving NP-Complete Problems Using P Systems with Active Membranes. In: Antoniou, I., Calude, C.S., Dinneen, M.J. (eds) Unconventional Models of Computation, UMC’2K. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0313-4_21
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0313-4_21
Publisher Name: Springer, London
Print ISBN: 978-1-85233-415-4
Online ISBN: 978-1-4471-0313-4
eBook Packages: Springer Book Archive