Membrane computing with external output
Fundamenta Informaticae
Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Theoretical Computer Science - Natural computing
Simulating turing machines by P Systems with external output
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
Complexity classes in models of cellular computing with membranes
Natural Computing: an international journal
| Hi-index | 0.00 |
We introduce decision P systems, which are a class of P systems with symbol-objects and external output. The main result of the paper is the following: if there exists an NP-complete problem that cannot be solved in polynomial time, with respect to the input length, by a deterministic decision P system constructed in polynomial time, then P 驴 NP. From Zandron-Ferreti-Mauri's theorem it follows that if P 驴 NP, then no NP-complete problem can be solved in polynomial time, with respect to the input length, by a deterministic P system with active membranes but without membrane division, constructed in polynomial time from the input. Together, these results give a characterization of P 驴 NP in terms of deterministic P systems