Proof techniques in membrane computing
From MaRDI portal
Publication:1998880
DOI10.1016/J.TCS.2020.09.041zbMath1497.68200OpenAlexW3089384150MaRDI QIDQ1998880
Mario J. Pérez-Jiménez, David Orellana-Martín, Luis Valencia-Cabrera
Publication date: 9 March 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/107709
Analysis of algorithms and problem complexity (68Q25) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Small (purely) catalytic P systems simulating register machines
- Membrane fission versus cell division: when membrane proliferation is not enough
- Computing with membranes
- Design patterns for efficient solutions to \(\mathrm{NP}\)-complete problems in membrane computing
- Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion
- Bounding the space in P systems with active membranes
- How derivation modes and halting conditions may influence the computational power of P systems
- Shallow laconic P-systems can count
- An improved universal spiking neural P system with generalized use of rules
- P systems with proteins: a new frontier when membrane division disappears
- Characterizing PSPACE with shallow non-confluent P systems
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
- Recent complexity-theoretic results on P systems with active membranes
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- Membrane Computing
- Characterizing Tractability by Tissue-Like P Systems
- Membrane Computing
- Membrane Computing
This page was built for publication: Proof techniques in membrane computing
