A new approach for solving SAT by p systems with active membranes

Authors:
Zsolt Gazdag;Gábor Kolonits
Affiliations:
Department of Algorithms and Their Applications Faculty of Informatics, Eötvös Loránd University, Hungary;Department of Algorithms and Their Applications Faculty of Informatics, Eötvös Loránd University, Hungary
Venue:
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Year:
2012

Citing 7
Cited 1

Computing with membranes

Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
P systems with minimal parallelism

Theoretical Computer Science
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
Polarizationless P systems with active membranes working in the minimally parallel mode

UC'07 Proceedings of the 6th international conference on Unconventional Computation
A new approach for solving SAT by p systems with active membranes

CMC'12 Proceedings of the 13th international conference on Membrane Computing

A new approach for solving SAT by p systems with active membranes

CMC'12 Proceedings of the 13th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give two families of P systems with active membranes that can solve the satisfiability problem of propositional formulas in linear time in the number of propositional variables occurring in the input formula. These solutions do not use polarizations of the membranes or non-elementary membrane division but use separation rules with relabeling. The first solution is a uniform one, but it is not polynomially uniform. The second solution, which is based on the first one, is a polynomially semi-uniform solution.