13th International Conference on Membrane Computing - MTA Sztaki

On efficient algorithms for SAT
32. Gh. Paun, P-systems with active membranes: attacking NP complete problems,
Unconventional Models of Computation (I. Antoniou, C.S. Calude, M.J. Dinneen,
eds.) Springer-Verlag, London (2000) 94-115 and CDMTCS Research report No.
102, 1999, Auckland Univ., New Zeland, www.cs.auckland.ac.nz/CDMTCS
33. Gh. Paun, Membrane Computing: An introduction, Springer-Verlag, Berlin (2002)
34. J. Pazos, A. Rodrguez-Patón, A. Silva, Solving SAT in Linear Time with a Neural-
Like Membrane System, Computational Methods in Neural Modeling (IWANN
2003), LNCS 2686, pp. 662–669 (2003)
35. M.J. Pérez-Jiménez, A. RomeroJiménez, F. Sancho-Caparrini, Computationally
hard problems addressed through P systems, in: G. Ciobanu, Gh. Paun, M.J. Pérez-
Jiménez (eds.), Applications of Membrane Computing, Springer-Verlag, Berlin, pp.
313-346 (2006)
36. M.J. Pérez-Jiménez, A. Ricsos-Núñez, A. RomeroJiménez, D. Woods, COMPLEX-
ITY MEMBRANE DIVISION, MEMBRANE CREATION, Chapter 12, 302–336
(2009)
37. U. Schöning, A Probabilistic Algorithm for k-SAT Based on Limited Local Search
and Restart, Algorithmica 32 (4), 615–623 (2002)
38. H. Tagawa, A. Fujiwara, Solving SAT and Hamiltonian Cycle Problem Using
Asynchronous P Systems, IEICE TRANSACTIONS on Information and Systems
Vol.E95-D No.3, 746–754 (2012)
39. C. Zandron, C. Ferretti, G. Mauri, Solving NP-complete problems using P systems
with active membranes, Unconventional Models of Computation (I. Antoniou, C.S.
Calude, M.J. Dinneen, eds.), Springer-Verlag, London, 289–301 (2000)
339