Membrane Computing
From MaRDI portal
Publication:5316643
DOI10.1007/B106721zbMATH Open1117.68380OpenAlexW2760751007MaRDI QIDQ5316643FDOQ5316643
Authors: Mario J. Pérez-Jiménez
Publication date: 14 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106721
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (35)
- Title not available (Why is that?)
- Efficiently solving the bin packing problem through bio-inspired mobility
- Title not available (Why is that?)
- The environment as a frontier of efficiency in tissue P systems with communication rules
- Aspects of Molecular Computing
- Searching Previous Configurations in Membrane Computing
- Tissue P systems with evolutional communication rules with two objects in the left-hand side
- Digital memcomputing: from logic to dynamics to topology
- Proof techniques in membrane computing
- Reversing computation in membrane systems
- On the efficiency of synchronized P systems
- Impacts of membrane computing on theoretical computer science (extended abstract)
- A computational complexity theory in membrane computing
- Membrane computing to enhance time efficiency of minimum dominating set
- From regulated rewriting to computing with membranes: collapsing hierarchies
- Rule synchronization for tissue P systems
- Solving SAT with P systems with anti-membranes
- From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency
- Complexity classes in models of cellular computing with membranes
- Cell-like P systems with evolutional symport/antiport rules and membrane creation
- Complexity of evolution in maximum cooperative P systems
- A path to computational efficiency through membrane computing
- Title not available (Why is that?)
- Cell-like P systems with polarizations and minimal rules
- Tissue-like P systems with evolutional symport/antiport rules
- Computational efficiency of dissolution rules in membrane systems
- When object production tunes the efficiency of membrane systems
- Generating, computing and recognizing with virus machines
- A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division
- Solving the 3-COL problem by using tissue P systems without environment and proteins on cells
- Towards “Fypercomputations” (in Membrane Computing)
- Computational complexity of simple P systems
- A Framework for Complexity Classes in Membrane Computing
- Selected Topics in Computational Complexity of Membrane Systems
- An unsupervised learning algorithm for membrane computing
Uses Software
This page was built for publication: Membrane Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316643)