Uniform solution of QSAT using polarizationless active membranes

Authors:
Artiom Alhazov;Mario J. Pérez-Jiménez
Affiliations:
Department of Information Technologies, Åbo Akademi University, Turku Center for Computer Science, Turku, Finland and Institute of Mathematics and Computer Science, Academy of Sciences of Mol ...;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain
Venue:
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Year:
2007

Citing 11
Cited 7

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
The computational power of cell division in P systems: Beating down parallel computers?

Natural Computing: an international journal
Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes

Fundamenta Informaticae
On the power of membrane division in P systems

Theoretical Computer Science - Words, languages and combinatorics
A fast P system for finding a balanced 2-partition

Soft Computing - A Fusion of Foundations, Methodologies and Applications
P systems with active membranes, without polarizations and without dissolution: a characterization of P

UC'05 Proceedings of the 4th international conference on Unconventional Computation
On the power of dissolution in p systems with active membranes

WMC'05 Proceedings of the 6th international conference on Membrane Computing
An approach to computational complexity in membrane computing

WMC'04 Proceedings of the 5th international conference on Membrane Computing
Attacking the common algorithmic problem by recognizer p systems

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

A Characterisation of NL Using Membrane Systems without Charges and Dissolution

UC '08 Proceedings of the 7th international conference on Unconventional Computing
Complexity of evolution in maximum cooperative P systems

Natural Computing: an international journal
The computational power of membrane systems under tight uniformity conditions

Natural Computing: an international journal
Selected topics in computational complexity of membrane systems

Computation, cooperation, and life
A computational complexity theory in membrane computing

WMC'09 Proceedings of the 10th international conference on Membrane Computing
Implementing p systems parallelism by means of GPUs

WMC'09 Proceedings of the 10th international conference on Membrane Computing
A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that the satisfiability problem (SAT) can be solved with a semi-uniform family of deterministic polarizationless P systems with active membranes with non-elementary membrane division. We present a double improvement of this result by showing that the satisfiability of a quantified Boolean formula (QSAT) can be solved by a uniform family of P systems of the same kind.