Complexity aspects of polarizationless membrane systems

Natural Computing

Volumn 8, Issue 4, 2009, Pages 703-717

  Leporati, Alberto ^a   Ferretti, Claudio ^a   Mauri, Giancarlo ^a   Pérez Jiménez, Mario J ^b   Zandron, Claudio ^a  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

^b UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Computational complexity; Membrane computing; PSPACE complete problems

Indexed keywords

ARTICLE; ARTIFICIAL INTELLIGENCE; COMPUTER ANALYSIS; EVOLUTION; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; MEMBRANE; POLARIZATION; PROBLEM SOLVING;

EID: 76849087979     PISSN: 15677818     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11047-008-9100-1     Document Type: Article

References (25)

1. Alhazov A, Freund R (2005) On efficiency of P systems with active membranes and two polarizations. In: Mauri G, Pǎun Gh, Pérez-Jiménez MJ, Rozenberg G, Salomaa A (eds) Membrane computing, 5th international workshop, WMC 2004. Revised selected and invited papers, LNCS 3365, Springer-Verlag, pp 81-94
2. Alhazov A, Pérez-Jiménez MJ (2006) Uniform solution to qsat using polarizationless active membranes. In: Gutiérrez MA, Pǎun Gh, Riscos-Núñez A, Romero-Campero FJ (eds) Proceedings of the Fourth Brainstorming Week on Membrane Computing, Volume I. Fénix Editora, Sevilla, pp 29-40
3. G Ciobanu L Pan Gh Pǎun MJ Pérez-Jiménez 1997 P systems with minimal parallelism Theor Comput Sci 378 1 117 130 10.1016/j.tcs.2007.03.044
4. Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory on NP-completeness. W.H. Freeman and Company
5. MA Gutiérrez-Naranjo MJ Pérez-Jiménez A Riscos-Núñez 2005 A fast P system for finding a balanced 2-partition Soft Comput 9 9 673 678 1101.68581 10.1007/s00500-004-0397-0 (Pubitemid 41001582)
6. Gutiérrez-Naranjo MA, Pérez-Jiménez MJ, Riscos-Núñez A, Romero-Campero FJ (2006a) On the power of dissolution in P systems with active membranes. In: Freund R, Pǎun Gh, Rozenberg G, Salomaa A (eds) Membrane computing, 6th International Workshop, WMC 2005, revised selected and invited papers, LNCS 3850, Springer-Verlag, pp 224-240.
7. Gutiérrez-Naranjo MA, Pérez-Jiménez MJ, Riscos-Núñez A, Romero-Campero FJ, Romero-Jiménez A (2006b) Characterizing tractability by cell-like membrane systems. In: Subramanian KG, Rangarajan K, Mukund M (eds) Formal models, languages and applications. World scientific, Series in machine perception and artificial intelligence, 66:137-154
8. SN Krishna R Rama 1999 A variant of P systems with active membranes: solving NP-complete problems Romanian J Inf Sci Technol 2 4 357 367
9. Mauri G, Pérez-Jiménez MJ, Zandron C (2007) On a Pǎun's conjecture in membrane systems. In: Mira J, Álvarez JR (eds) Second international work-conference on the interplay between natural and artificial computation, IWINAC 2007, LNCS 4527, Springer-Verlag, pp 180-192
10. A Obtulowicz 2001 Deterministic P systems for solving sat problem Romanian J Inf Sci Technol 4 1-2 551 558 1847854
11. Pǎun Gh (2000a) Computing with membranes. J Comput Syst Sci 1(61):108-143
12. See also Turku centre for computer science - TUCS report no. 208, 1998. Available at http://www.tucs.fi/ Publications/techreports/TR208.php
13. Pǎun Gh (2000b) Computing with membranes: attacking NP-complete problems. In: Antoniou I, Calude C, Dinneen MJ (eds) Unconventional models of computation. Springer-Verlag, pp 94-115
14. Gh Pǎun 2001 P systems with active membranes: attacking NP-complete problems Journal of Autom Lang Comb 6 1 75 90 0970.68066
15. Pǎun Gh (2002) Membrane Computing. An Introduction. Springer-Verlag, NewYork
16. Pǎun Gh (2005) Further twenty six open problems in membrane computing. In: Gutiérrez-Naranjo MA, Riscos-Núñez A, Romero-Campero FJ, Sburlan D (eds) Proceedings of the Third Brainstorming Week on Membrane Computing. Fénix Editora, Sevilla, pp 249-262
17. Pérez-Jiménez MJ, Riscos-Núñez A (2004) A linear-time solution to the Knapsack problem using P systems with active membranes. In: Martín-Vide C, Pǎun Gh, Rozenberg G, Salomaa A (eds) Membrane Computing, International Workshop, WMC 2003. Revised Papers, LNCS 2933, Springer-Verlag, pp 250-268
18. MJ Pérez-Jiménez A Riscos-Núñez 2005 Solving the Subset Sum problem by active membranes New Gener Comput 23 4 367 384
19. Pérez-Jiménez MJ, Romero-Campero FJ (2005) Attacking the Common Algorithmic Problem by recognizer P systems. In: Margenstern M (eds) Machines, Computations and Universality, LNCS 3354, Springer-Verlag, pp 304-315
20. Pérez-Jiménez MJ, Romero-Jiménez A, Sancho-Caparrini F (2003) A polynomial complexity class in P systems using membrane division. In: Csuhaj-Varjú E, Kintala C, Wotschke D, Vaszil G (eds) Proceedings of the 5th workshop on descriptional complexity of formal systems, DCFS 2003, computer and automation research institute of the Hungarian Academy of Sciences, Budapest, pp 284-294
21. Pérez-Jiménez MJ, Romero-Jiménez A, Sancho-Caparrini F (2004) The P versus NP problem through cellular computing with membranes. In: Jonoska N, Paun Gh, Rozenberg Gr (eds) Aspects of Molecular Computing, LNCS 2950, Springer-Verlag, pp 338-352
22. P Sosik 2003 The computational power of cell division Natural Computing 2 3 287 298 1048.68044 10.1023/A:1025401325428 2024482 (Pubitemid 39137565)
23. The P systems (2000) Web page: http://ppage.psystems.eu/
24. Zandron C, Ferretti C, Mauri G (2000) Solving NP-complete problems using P systems with active membranes. In: Antoniou I, Calude C, Dinneen MJ (eds) Unconventional Models of Computation. Springer-Verlag, pp 289-301
25. Zandron C, Leporati A, Mauri G, Ferretti C, Pérez-Jiménez J On the computational efficiency of polarizationless recognizer P systems with strong division and dissolution. Fundamenta Informaticae (to appear)