A toolbox for simpler active membrane algorithms
From MaRDI portal
Publication:524283
DOI10.1016/J.TCS.2017.03.015zbMath1370.68094OpenAlexW2601035715WikidataQ57518142 ScholiaQ57518142MaRDI QIDQ524283
Luca Manzoni, Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron
Publication date: 2 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/49832
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (2)
Bounding the space in P systems with active membranes ⋮ Characterizing PSPACE with shallow non-confluent P systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computational power of membrane systems under tight uniformity conditions
- P systems with minimal parallelism
- Complexity classes in models of cellular computing with membranes
- The computational power of cell division in P systems: Beating down parallel computers?
- Computing with membranes
- Space complexity equivalence of P systems with active membranes and Turing machines
- Membrane Division, Oracles, and the Counting Hierarchy
- P Systems with Elementary Active Membranes: Beyond NP and coNP
- Computational efficiency of dissolution rules in membrane systems
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems
- Membrane Computing
- Membrane Computing
- Membrane Computing
This page was built for publication: A toolbox for simpler active membrane algorithms
