13th International Conference on Membrane Computing - MTA Sztaki

On efficient algorithms for SAT
the number of variables. This method also uses exponential space of the number
of used variables. The space complexity is measured by the used number of
subintervals of the basic interval [0, 1). The algorithm consists of a linear number
of steps (operations) on the length of the input formula, so that the intervalvalues
of linear number of subformulae are computed and stored. It could be an
interesting and challenging task to mix the features of interval-valued computing
and P-systems. This mixture could help to develop further highly parallel
algorithms that can solve SAT and other intractable problems in their original
form (as it is discussed in Section 4). We believe that this task could also be
useful for the problem P=NP...
Acknowledgements
We are grateful to Gy. Vaszil for his help for searching literature. He is encouraged
the author to submit the paper to the conference CMC13.
The work is partly supported by the TÁMOP 4.2.1/B-09/1/KONV-2010-0007
project. The project is implemented through the New Hungary Development
Plan, co-financed by the European Social Fund and the European Regional Development
Fund.
References
1. A. Alhazov, Solving SAT by Symport/Antiport P Systems with Membrane Division,
in: M.A. Gutiérrez-Naranjo, Gh. Paun, M.J. Pérez-Jiménez: Cellular Computing
(Complexity Aspects), ESF PESC Exploratory Workshop, Fénix Editora, Sevilla,
1–6 (2005)
2. A. Alhazov, Minimal Parallelism and Number of Membrane Polarizations, Computer
Science Journal of Moldova, vol.18, no.2 (53), 149–170 (2010)
3. A. Alhazov, R. Freund, On the Efficiency of P Systems with Active Membranes
and Two Polarizations, WMC5 2004, LNCS 3365, pp. 146-160 (2005)
4. B. Aman, G. Ciobanu, Solving weak NP-complete problems in polynomial time with
mutual mobile membrane systems, FML-11-2 Technical Report, Series of technical
reports (Institute of Computer Science Iaşi) (2011)
5. T. Brueggeman, W. Kern, An improved deterministic local search algorithm for
3-SAT, Theoretical Computer Science 329 (1-3), 303–313 (2004)
6. G. Ciobanu, L. Pan, Gh. Paun, M.J. Pérez-Jiménez, P systems with minimal parallelism,
Theoretical Computer Science 378, 117-130 (2007)
7. E. Dantsin, A. Goerdt, E. A. Hirsch, R. Kannan, J. Kleinberg, C. H. Papadimitriou,
P. Raghavan, U. Schöning: A deterministic (2 − 2/(k + 1))n algorithm for k-SAT
based on local search, Theoretical Computer Science 289 (1), 69–83 (2002)
8. J. Dassow, Gh. Paun, Regulated rewriting in Formal Language Theory, Akademie-
Verlag, Berlin, (1989)
9. P. Frisco, G. Govan, P Systems with Active Membranes Operating under Minimal
Parallelism, CMC 2011, LNCS 7184, pp. 165-181 (2012)
10. J. Heering, P. Klint, J. Rekers, Incremental generation of lexical scanners, ACM
Transactions on Programming Languages and Systems (TOPLAS), 14 (4), 490–520
(1992)
337