Selected Topics in Computational Complexity of Membrane Systems
From MaRDI portal
Publication:3009341
DOI10.1007/978-3-642-20000-7_10zbMath1330.68081OpenAlexW69314239MaRDI QIDQ3009341
Publication date: 24 June 2011
Published in: Computation, Cooperation, and Life (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20000-7_10
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Membrane computing and complexity theory: A characterization of PSPACE
- Normal forms for spiking neural P systems
- Unconventional computation. 7th international conference, UC 2008, Vienna, Austria, August 25--28, 2008. Proceedings
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- Complexity classes in models of cellular computing with membranes
- A new algorithm for regularizing one-letter context-free grammars.
- Machines, computations, and universality. 5th international conference, MCU 2007, Orléans, France, September 10--13, 2007. Proceedings.
- Complexity aspects of polarizationless membrane systems
- Polynomial Complexity Classes in Spiking Neural P Systems
- ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS
- On the Computational Complexity of Spiking Neural P Systems
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Membrane Computing in Connex Environment
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
- Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
- A Computational Complexity Theory in Membrane Computing
- On the Power of Computing with Proteins on Membranes
- An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes
