Nondeterministic space is closed under complementation
SIAM Journal on Computing
Expressibility and parallel complexity
SIAM Journal on Computing
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Membrane Computing: An Introduction
Membrane Computing: An Introduction
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
Membrane computing and complexity theory: A characterization of PSPACE
Journal of Computer and System Sciences
Uniform solution of QSAT using polarizationless active membranes
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Asynchronous P systems with active membranes
Theoretical Computer Science
P systems simulating oracle computations
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Sublinear-Space p systems with active membranes
CMC'12 Proceedings of the 13th 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 apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined as uniform families of computational devices. To date, polynomial time uniformity has been the accepted uniformity notion for membrane systems. Here, we introduce the idea of using AC 0-uniformity and investigate the computational power of membrane systems under these tighter conditions. It turns out that the computational power of some systems is lowered from P to NL when using AC 0-semi-uniformity, so we argue that this is a more reasonable uniformity notion for these systems as well as others. Interestingly, other P-semi-uniform systems that are known to be lower-bounded by P are shown to retain their P lower-bound under the new tighter semi-uniformity condition. Similarly, a number of membrane systems that are known to solve PSPACE-complete problems retain their computational power under tighter uniformity conditions.