Computational efficiency of dissolution rules in membrane systems
From MaRDI portal
Recommendations
Cites work
- A fast \(P\) system for finding a balanced 2-partition
- Computing with membranes
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- Membrane Computing
- On the power of membrane division in P systems
- The computational power of cell division in P systems: Beating down parallel computers?
Cited in
(17)- The counting power of P systems with antimatter
- A Turing machine simulation by P systems without charges
- Alternative space definitions for P systems with active membranes
- Cell-like P systems with polarizations and minimal rules
- Monodirectional P systems
- Time-free solution to SAT problem using P systems with active membranes
- Membrane Dissolution and Division in P
- A Characterisation of NL Using Membrane Systems without Charges and Dissolution
- A framework for complexity classes in membrane computing
- A toolbox for simpler active membrane algorithms
- The computational power of membrane systems under tight uniformity conditions
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- A Logarithmic Bound for Solving Subset Sum with P Systems
- Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
- Membrane Computing
- On the power of membrane dissolution in polarizationless P systems with active membranes
- Evaluating space measures in P systems
This page was built for publication: Computational efficiency of dissolution rules in membrane systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3427661)