A linear solution for QSAT with membrane creation

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

Volumn 3850 LNCS, Issue , 2006, Pages 241-252

  Gutiérrez Naranjo, Miguel A ^a   Pérez Jiménez, Mario J ^a   Romero Campero, Francisco J ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

LINEAR TIME; MEMBRANE CREATION; POLYNOMIAL TIME;

LINEAR SYSTEMS;

EID: 33745668434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603047_17     Document Type: Conference Paper

References (15)

1. M.R. Garey, D.S. Johnson: Computers and Intractability A Guide to the theory of NP-Completeness. W.H. Freeman and Company, 1979.
2. M.A. Gutiérrez-Naranjo, M.J. Pérez-Jiménez, F.J. Romero-Campero: A linear solution of Subset Sum Problem by using Mmmbrane creation. In Mechanisms, Symbols and Models Underlying Using Cognition, First International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2005 (J. Mira, J.R. Alvarez, eds.). LNCS 3561, Springer, Berlin, 2005, 258-267.
3. M.A. Gutiérrez-Naranjo, M.J. Pérez-Jiménez, F.J. Romero-Campero: Solving SAT with Membrane Creation. In Computability in Europe 2005, CiE 2005: New Computational Paradigms (S. Barry Cooper, B. Lowe, L. Torenvliet, eds.), Report ILLC X-2005-01, University of Amsterdam, 82-91.
4. 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.
5. P.L. Luisi: The chemical implementation of autopoiesis, Self-Production of Supramolecular Structures (G.R. Fleishaker et al., eds.), Kluwer, Dordrecht, 1994.
6. C.H. Papadimitriou: Computational Complexity. Addison-Wesley, Reading, Mass., 1994.
7. Gh. Pǎun: Membrane Computing. An Introduction, Springer, Berlin, 2002.
8. Gh. Pǎun, M.J. Pérez-Jiménez: Recent computing models inspired from biology: DNA and membrane computing, Theoria, 18, 46 (2003), 72-84.
9. Gh. Pǎun: Further open problems in membrane computing. Proceedings of the Second Brainstorming Week on Membrane Computing (Gh. Pǎun, A. Riscos-núñez, A. Romero-Jiménez, F. Sancho-Caparrini, eds.), Report RGNC 01/04, University of Seville, 2004, 354-365.
10. 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.
11. M.J. Pérez-Jiménez, A. Riscos-Núñez: A linear solution for the Knapsack problem using active membranes. Membrane Computing. International Workshop, WMC2003, Tarragona, Spain, July 2003, Revised Papers (C. Martín-Vide, G. Mauri, Gh. Pǎun, G. Rozenberg, A. Salomaa, eds.), LNCS 2933, Springer, Berlin, 2004, 250-268.
12. M.J. Pérez-Jiménez, F.J. Romero-Campero: Solving the BIN PACKING problem by recognizer P systems with active membranes. In Proceedings of the Second Brainstorming Week on Membrane Computing (Gh. Pǎun, A. Riscos-Núñez, A. Romero-Jiménez, F. Sancho-Caparrini, eds.), Report RGNC 01/04, University of Seville, 2004, 414-430.
13. M.J. Pérez-Jiménez, A. Romero-Jiménez, F. Sancho-Caparrini: A polynomial complexity class in P systems using membrane division. In Proceedings of the 5th Workshop on Descriptional Complexity of Formal Systems, DCFS 2003 (E. Csuhaj-Varjú, C. Kintala, D. Wotschke, Gy. Vaszyl, eds.), 2003, 284-294.
14. L.J. Stockmeyer, A.R. Meyer: Word problems requiring exponential time. Proc. 5th ACM Symp. on the Theory of Computing, 1973, 1-9.
15. P systems web page http://psystems.disco.unimib.it/