An approach to computational complexity in membrane computing

Lecture Notes in Computer Science

Volumn 3365, Issue , 2005, Pages 85-109

  Pérez Jiménez, Mario J ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; POLYNOMIALS;

CLASSICAL DETERMINISTIC MODES; MEMBRANE COMPUTING; NON-DETERMINISTIC MODES; POLYNOMIAL COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 24144477513     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31837-8_5     Document Type: Conference Paper

References (45)

1. A. Alhazov, R. Freund, Gh. Pǎun, P systems with active membranes and two polarizations. Proceedings of the Second Brainstorming Week on Membrane Computing (Gh. Pǎun, A. Riscos, A. Romero, F. Sancho, eds.), Report RGNC 01/04, 2004, 20-35.
2. A. Alhazov, T.-O. Ishdorj, Membrane operations in P systems with active membranes. Proceedings of the Second Brainstorming Week on Membrane Computing (Gh. Pǎun, A. Riscos, A. Romero, F. Sancho, eds.), Report RGNC 01/04, 2004, 37-52.
3. A. Alhazov, C. Martín-Vide, L. Pan, Solving graph problems by P systems with restricted elementary active membranes. Aspects of Molecular Computing (N. Jonoska, Gh. Pǎun, G. Rozenberg, eds.), Lecture Notes in Computer Science, 2950 (2004), 1-22.
4. A. Alhazov, L. Pan, Gh. Pǎun, Trading polarizations for labels in P systems with active membranes. Acta Informatica, to appear.
5. J. Castellanos, Gh. Pǎun, A. Rodríguez-Patón, P systems with worm-objects. IEEE 7th International Conference on String Processing and Information Retrieval, SPIRE 2000, La Coruña, Spain, 64-74.
6. A. Cordón-Franco, M.A. Gutiérrez-Naranjo, M.J. Pérez-Jiménez, F. Sancho-Caparrini, Implementing in Prolog an effective cellular solution for the Knapsack problem. Membrane Computing (C. Martín-Vide, Gh. Pǎun, G. Rozenberg, A. Salomaa, eds.), Lecture Notes in Computer Science, 2933 (2004), 140-152.
7. E. Czeiler, Self-activating P systems. Membrane Computing (Gh. Pǎun, G. Rozenberg, A, Salomaa, C. Zandron, eds.), Lecture Notes in Computer Science, 2597 (2003), 234-246.
8. M.R. Garey, D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
9. 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, in press.
10. T. Head, M. Yamamura, S. Gal, Aqueous computing: writing on molecules. Proceedings of the Congress on Evolutionary Computation 1999, IEEE Service Center, Piscataway, NJ, 1999, 1006-1010.
11. M. Ito, C. Martín-Vide, Gh. Pǎun, Characterization of Parikh sets of ETOL languages in terms of P systems. In Words, Semigroups, and Transducers (M. Ito, Gh. Pǎun, S. Yu, eds.), World Scientific, Singapore, 2001, 239-254.
12. 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.
13. S.N. Krishna, R. Rama, P systems with replicated rewriting. Journal of Automata, Languages and Combinatorics, 6, 1 (2001), 345-350.
14. S.N. Krishna, R. Rama, Breaking DES using P systems. Theoretical Computer Science, 299, 1-3 (2003), 495-508.
15. M. Madhu, K. Kristhivasan, P systems with membrane creation: Universality and efficiency. Proceedings Third International Conference on Universal, Machines and Computations, Chisinau, Moldova, 2001 (M. Margenstern, Y. Rogozhin, eds.), Lecture Notes in Computer Science, 2055 (2001), 276-287.
16. A. Obtulowicz, Deterministic P systems for solving SAT problem. Romanian Journal of Information Science and Technology, 4, 1-2 (2001), 551-558.
17. A. Obtulowicz, On P systems with active membranes: Solving the Integer Factorization problem in a polynomial time. In Multiset Processing. Mathematical, Computer Science, and Molecular Computing Points of View (C.S. Calude, Gh. Pǎun, G. Rozenberg, A. Salomaa, eds.), Lecture Notes in Computer Science, 2235 (2001), 267-285.
18. A. Obtulowicz, Note on some recursively family of P systems with active membranes. Submitted, 2004.
19. L. Pan, A. Alhazov, T.-O. Ishdorj, Further remarks on P systems with active membranes, separation, merging, and release rules. Proceedings of the Second Brainstorming Week on Membrane Computing (Gh. Pǎun, A. Riscos, A. Romero, F. Sancho, eds.), Report RGNC 01/04, 2004, 316-324.
20. L. Pan, T.-O. Ishdorj, P systems with active membranes and separation rules. Journal of Universal Computer Science, 10, 5 (2004), 630-649.
21. L. Pan, C. Martín-Vide, C. Solving multiset 0-1 knapsack problem by P systems with input and active membranes. Proceedings of the Second Brainstorming Week on Membrane Computing (Gh. Pǎun, A. Riscos, A. Romero, F. Sancho, eds.), Report RGNC 01/04, 2004, 342-353.
22. A. Pǎun, On P systems with membrane division. In Unconventional Models of Computation (I. Antoniou, C.S. Calude, M.J. Dinneen, eds.), Springer, London, 2000, 187-201.
23. Gh. Pǎun, Computing with membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108-143,
24. and Turku Center for Computer Science- TUCS Report Nr. 208, 1998.
25. Gh. Pǎun, Computing with membranes: Attacking NP-complete problems. In Unconventional Models of Computation (I. Antoniou, C.S. Calude, M.J. Dinneen, eds.), 2000, 94-115.
26. Gh. Pǎun, P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics, 6, 1 (2001), 75-90.
27. Gh. Pǎun, Membrane Computing. An Introduction, Springer-Verlag, Berlin, 2002.
28. Gh. Pǎun, M.J. Pérez-Jiménez, A. Riscos-Núñez, P systems with tables of rules. Theory is Forever. Essays Dedicated to Arto Salomaa on the Ocassion of His 70th Birthday (J. Karhumaki, H. Maurer, Gh. Pǎun, G. Rozenberg, eds.), Lecture Notes in Computer Science, 3113 (2004), 235-249.
29. Gh. Pǎun, G. Rozenberg, A guide to membrane computing. Theoretical Computer Science, 287 (2002), 73-100.
30. Gh. Pǎun, Y. Suzuki, H. Tanaka, T. Yokomori, On the power of membrane division in P systems. Theoretical Computer Science, 324, 1 (2004), 61-85.
31. M.J. Pérez-Jiménez, A. Riscos-Núñez, Solving the Subset-Sum problem by P systems with active membranes. New Generation Computing, in press.
32. M.J. Pérez-Jiménez, A. Riscos-Núñez, A linear time solution to the Knapsack problem using active membranes. Membrane Computing (C. Martín-Vide, Gh. Pǎun, G. Rozenberg, A. Salomaa, eds.). Lecture Notes in Computer Science, 2933 (2004), 250-268.
33. M.J. Pérez-Jiménez, F.J. Romero-Campero, Trading polarizations for bi-stable catalysts in P systems with active membranes. In this volume.
34. M.J. Pérez-Jiménez, F.J. Romero-Campero, An efficient family of P systems for packing items into bins. Journal of Universal Computer Science, 10, 5 (2004), 650-670.
35. M.J. Pérez-Jiménez, F.J. Romero-Campero, Attacking the Common Algorithmic problem by recognizer P systems. Pre-proceedings of the Machines, Computations and Universality, MCU'2004 (abstracts), September 21-26, 2004, Sankt Petesburg, p. 27.
36. M.J. Pérez-Jiménez, A. Romero-Jiménez, F. Sancho-Caparrini, Teoría de la Complejidad en Modelos de Computación con Membranas, Ed. Kronos, Sevilla, 2002.
37. M.J. Pérez-Jiménez, A. Romero-Jiménez, F. Sancho-Caparrini, Complexity classes in models of cellular computing with membranes. Natural Computing, 2, 3 (2003), 265-285.
38. M.J. Pérez-Jiménez, A. Romero-Jiménez, F. Sancho-Caparrini, Solving VALIDITY problem by active membranes with input. Proceedings of the Brainstorming Week on Membrane Computing (M. Cavaliere, C. Martín-Vide, Gh. Pǎun, eds.), Report GRLMC 26/03, 2003, 279-290.
39. M.J. Pérez-Jiménez, A. Romero-Jiménez, F. Sancho-Caparrini, The P versus NP problem through cellular computing with membranes. Aspects of Molecular Computing. Essays Dedicated to Tom Head on the Ocassion of His 70th Birthday (N. Jonoska, Gh. Pǎun, G. Rozenberg, eds.), Lecture Notes in Computer Science, 2950 (2004), 338-352.
40. A. Riscos-Núñez, Programación celular: Resolución eficiente de problemas numéricos NP-completos. PhD. Thesis, University of Seville, Spain, 2004.
41. A. Romero-Jiménez, Complexity and Universality in Cellular Computing Models, PhD. Thesis, University of Seville, Spain, 2003.
42. A. Romero-Jiménez, M.J. Pérez-Jiménez, Simulating Turing machines by P systems with external output. Fundamenta Informaticae, 49, 1-3 (2002), 273-287.
43. P. Sosik, The computational power of cell division. Natural Computing, 2, 3 (2003), 287-298.
44. C. Zandron, C. Ferreti, G. Mauri, Solving NP-complete problems using P systems with active membranes. In Unconventional Models of Computation, UMC'2K (I. Antoniou, C. Calude, M.J. Dinneen, eds.), Springer-Verlag, Berlin, 2000, 289-301.
45. C. Zandron, G. Mauri, C. Ferreti, Universality and normal forms on membrane systems. Proceedings International Workshop on Grammar Systems, 2000 (R. Freund, A. Kelemenova, eds.), Bad Ischl, Austria, July 2000, 61-74.