Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
Computation: finite and infinite machines
Computation: finite and infinite machines
P Systems with Proteins on Membranes
Fundamenta Informaticae
Counting time in computing with cells
DNA'05 Proceedings of the 11th international conference on DNA Computing
On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Communicative p systems with minimal cooperation
WMC'04 Proceedings of the 5th international conference on Membrane Computing
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Membrane Computing and Brane Calculi (Some Personal Notes)
Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane Systems with Peripheral Proteins: Transport and Evolution
Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane computing and brane calculi. Old, new, and future bridges
Theoretical Computer Science
Decision problems in membrane systems with peripheral proteins, transport and evolution
Theoretical Computer Science
Theoretical Computer Science
Computing with cells: membrane systems-some complexity issues
International Journal of Parallel, Emergent and Distributed Systems
On flip-flop membrane systems with proteins
WMC'07 Proceedings of the 8th international conference on Membrane computing
On the power of computing with proteins on membranes
WMC'09 Proceedings of the 10th international conference on Membrane Computing
| Hi-index | 0.00 |
In this paper we present a method for solving the NP-complete SAT problem using the type of P systems that is defined in [9]. The SAT problem is solved in O(nm) time, where n is the number of boolean variables and m is the number of clauses for a instance written in conjunctive normal form. Thus we can say that the solution for each given instance is obtained in linear time. We succeeded in solving SAT by a uniform construction of a deterministic P system which uses rules involving objects in regions, proteins on membranes, and membrane division. We also investigate the computational power of the systems with proteins on membranes and show that the universality can be reached even in the case of systems that do not even use the membrane division and have only one membrane.