A Σ2P∪ Π2Plower bound using mobile membranes
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Replicative - distribution rules in p systems with active membranes
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Boolean circuits and a DNA algorithm in membrane computing
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Minimal parallelism for polarizationless p systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Inhibiting/de-inhibiting rules in p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Modeling neural processes in lindenmayer systems
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Properties of membrane systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
On efficient algorithms for SAT
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Hi-index | 0.00 |
The P systems are a class of distributed parallel computing devices of a biochemical type. In this note, we show that by using membrane separation to obtain exponential workspace, SAT problem can be solved in linear time in a uniform and confluent way by active P systems without polarizations. This improves some results already obtained by A. Alhazov, T.-O. Isdorj. A universality result related to membrane separation is also obtained.