Aspects of Molecular Computing

DOI10.1007/b94864zbMath1200.68117OpenAlexW2478546718MaRDI QIDQ5901846

Fernando Sancho Caparrini, Álvaro Romero-Jiménez, Mario J. Pérez-Jiménez

Publication date: 14 May 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94864

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (11)

Non-confluence in divisionless P systems with active membranes ⋮ Complexity aspects of polarizationless membrane systems ⋮ A uniform family of tissue P systems with cell division solving 3-COL in a linear time ⋮ P systems with active membranes: Trading time for space ⋮ Computational complexity of tissue-like P systems ⋮ Tissue-like P systems with evolutional symport/antiport rules ⋮ Monodirectional tissue P systems with channel states ⋮ A Framework for Complexity Classes in Membrane Computing ⋮ A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division ⋮ Complexity classes for membrane systems ⋮ A Linear–time Tissue P System Based Solution for the 3–coloring Problem

This page was built for publication: Aspects of Molecular Computing