On a pǎun's conjecture in membrane systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4527 LNCS, Issue PART 1, 2007, Pages 180-192

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

^a UNIVERSITY OF SEVILLE   (Spain)

^b UNIVERSITY OF MILANO BICOCCA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROCESSING SYSTEMS; POLARIZATION; PROBLEM SOLVING; SYSTEMS ENGINEERING;

MEMBRANE SYSTEMS; POLARIZATIONLESS P SYSTEMS;

BIOLOGICAL MEMBRANES;

EID: 38149019231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73053-8_18     Document Type: Conference Paper

References (20)

1. A. Alhazov, R. Freund. On efficiency of P systems with active membranes and two polarizations. In [9], 81-94.
2. A. Alhazov, M.J. Pérez-Jiménez. Uniform solution to QSAT using polarizationless active membranes. In M.A. Gutiérrez, Gh. Pǎun, A. Riscos, F.J. Romero (eds.) Proceedings of the Fourth Brainstorming Week on Membrane Computing, Volume I, Fénix Editora, Sevilla, 2006, 29-40.
3. G. Ciobanu, L. Pan, Gh. Pǎun, M.J. Pérez-Jiménez. P systems with minimal parallelism. Theoretical Computer Sci., to appear.
4. M.A. Gutiérrez-Naranjo, M.J. Pérez-Jiménez, A. Riscos-Núñez, F.J. Romero-Campero. On the power of dissolution in P systems with active membranes. Lecture Notes in Computer Science, 3850 (2006), 224-240.
5. M.A. Gutiérrez-Naranjo, M.J. Pérez-Jiménez, A. Riscos-Núñez, F.J. Romero-Campero, A. Romero-Jiménez. Characterizing tractability by cell-like membrane systems. In K.G. Subramanian, K. Rangarajan, M. Mukund (eds.) Formal models, languages and applications, World Scientific, Series in Machine Perception and Artificial Intelligence - Vol. 66, 2006, pp. 137-154.
6. M.A. Gutiérrez-Naranjo, M.J. Pérez-Jiménez, A. Riscos-Núñez. A fast P system for finding a balanced 2-partition. Soft Computing, 9, 9 (2005), 673-678.
7. S.N. Krishna, R. Rama. A variant of P systems with active membranes: Solving NP-complete problems. Romanian Journal of Information Science and Technology, 2, 4 (1999), 357-367.
8. A. Obtulowicz. Deterministic P systems for solving SAT problem. Romanian Journal of Information Science and Technology, 4, 1-2 (2001), 551-558.
9. G. Mauri, Gh. Pǎun, M.J. Pérez-Jiménez, G. Rozenberg, A. Salomaa (eds.). Membrane Computing, International Workshop, WMC5, Milano, Italy, 2004, Selected Papers, Lecture Notes in Computer Science, 3365, Springer-Verlag, Berlin, 2005.
10. C.H. Papadimitriou. Computational Complexity, Addison-Wesley, Massachussetts, 1995.
11. Gh. Pǎun. P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics, 6, 1 (2001), 75-90.
12. Gh. Pǎun. Computing with membranes: Attacking NP-complete problems. In I. Antoniou, C. Calude, M.J. Dinneen (eds.) Unconventional Models of Computation, Springer-Verlag, London, 2000, 94-115.
13. Gh. Pǎun. Further twenty six open problems in membrane computing. In M.A. Gutiérrez, A. Riscos, F.J. Romero, D. Sburlan (eds.) Proceedings of the Third Brainstorming Week on Membrane Computing, Fénix Editora, Sevilla, 2005, 249-262
14. M.J. Pérez-Jiménez, A. Romero-Jiménez, F. Sancho-Caparrini. The P versus NP problem through cellular computing with membranes. In N. Jonoska, Gh. Paun, Gr. Rozenberg (eds.) Aspects of Molecular Computing, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2950 (2004), 338-352.
15. M.J. Pérez-Jiménez, A. Riscos-Núñez. Solving the Subset-Sum problem by active membranes. New Generation Computing, 23, 4 (2005), 367-384.
16. M.J. Pérez-Jiménez, A. Riscos-Núñez. A linear-time solution to the Knapsack problem using P systems with active membranes. In C. Martín-Vide, Gh. Pǎun, G. Rozenberg, A. Salomaa (eds.) Membrane Computing, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2933 (2004), 250-268.
17. M.J. Pérez-Jiménez, A. Romero-Jiménez, F. Sancho-Caparrini. A polynomial complexity class in P systems using membrane division. In E. Csuhaj-Varjú, C. Kintala, D. Wotschke, G. Vaszil (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, 2003, pp. 284-294.
18. M.J. Pérez-Jiménez, F.J. Romero-Campero. Attacking the Common Algorithmic Problem by recognizer P systems. In M. Margenstern (ed.) Machines, Computations and Universality, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 3354 (2005), 304-315.
19. P. Sosik. The computational power of cell division. Natural Computing, 2, 3 (2003), 287-298.
20. C. Zandron, C. Ferretti, G. Mauri. Solving NP-complete problems using P systems with active membranes. In I. Antoniou, C. Calude, M.J. Dinneen (eds.) Unconventional Models of Computation, Springer-Verlag, Berlin, 2000, 289-301.