Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Membrane Computing: An Introduction
Membrane Computing: An Introduction
GP Systems with forbidding context
Fundamenta Informaticae - Membrane computing
Solving NP-Complete Problems Using P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
The computational power of cell division in P systems: Beating down parallel computers?
Natural Computing: an international journal
From regulated rewriting to computing with membranes: collapsing hierarchies
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
A polynomial complexity class in P systems using membrane division
Journal of Automata, Languages and Combinatorics
On the power of dissolution in p systems with active membranes
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the efficiency of p systems with active membranes and two polarizations
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On a powerful class of non-universal P systems with active membranes
DLT'10 Proceedings of the 14th international conference on Developments in language theory
P systems with elementary active membranes: beyond NP and coNP
CMC'10 Proceedings of the 11th international conference on Membrane computing
| Hi-index | 0.00 |
We consider recognizer P systems having three polarizations associated to the membranes, and we show that they are able to solve the PSPACE-complete problem Quantified 3SAT when working in polynomial space and exponential time. The solution is uniform (all the instances of a fixed size are solved by the same P system) and uses only communication rules: evolution rules, as well as membrane division and dissolution rules, are not used. Our result shows that, as it happens with Turing machines, this model of P systems can solve in exponential time and polynomial space problems that cannot be solved in polynomial time, unless P = SPACE.