PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Solving NP-Complete Problems Using P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
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
Membrane computing and complexity theory: A characterization of PSPACE
Journal of Computer and System Sciences
The computational power of membrane systems under tight uniformity conditions
Natural Computing: an international journal
An efficient simulation of polynomial-space turing machines by p systems with active membranes
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Space complexity equivalence of P systems with active membranes and Turing machines
Theoretical Computer Science
| Hi-index | 0.00 |
We show how existing P systems with active membranes can be used as modules inside a larger P system; this allows us to simulate subroutines or oracles. As an application of this construction, which is (in principle) quite general, we provide a new, improved lower bound to the complexity class PMC $_{\mathcal{AM}(-{\rm d},-{\rm n})}$ of problems solved by polynomial-time P systems with (restricted) elementary active membranes: this class is proved to contain PPP and hence, by Toda's theorem, the whole polynomial hierarchy.