Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
On P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Computing with Membranes: Attacking NP-Complete Problems
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Solving NP-Complete Problems Using P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
On P Systems with Active Membranes Solving the Integer Factorization Problem in a Polynomial Time
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Systems with Membrane Creation: Universality and Efficiency
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Theoretical Computer Science
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
On the power of membrane division in P systems
Theoretical Computer Science - Words, languages and combinatorics
A fast P system for finding a balanced 2-partition
Soft Computing - A Fusion of Foundations, Methodologies and Applications
A Framework for Complexity Classes in Membrane Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity of evolution in maximum cooperative P systems
Natural Computing: an international journal
Uniform solution of QSAT using polarizationless active membranes
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Membrane computing as a modeling framework: cellular systems case studies
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
UC'05 Proceedings of the 4th international conference on Unconventional Computation
On the power of dissolution in p systems with active membranes
WMC'05 Proceedings of the 6th international conference on Membrane Computing
A computational complexity theory in membrane computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
| Hi-index | 0.00 |
In this paper we present a theory of computational complexity in the framework of membrane computing. Polynomial complexity classes in recognizer membrane systems and capturing the classical deterministic and non-deterministic modes of computation, are introduced. In this context, a characterization of the relation P=NP is described.