Membrane Computing

DOI10.1007/11603047zbMath1135.68411OpenAlexW4246411629MaRDI QIDQ5897729

Francisco J. Romero-Campero, Mario J. Pérez-Jiménez, Miguel Á. Gutiérrez-Naranjo

Publication date: 13 November 2006

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (12)

Membrane creation and symport/antiport rules solving QSAT ⋮ P systems and computational algebraic topology ⋮ Cell-like P systems with evolutional symport/antiport rules and membrane creation ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ Bounding the space in P systems with active membranes ⋮ Solving a PSPACE-complete problem with cP systems ⋮ A uniform family of tissue P systems with cell division solving 3-COL in a linear time ⋮ Computational efficiency and universality of timed P systems with membrane creation ⋮ A uniform solution to the independent set problem through tissue P systems with cell separation ⋮ Computational complexity of tissue-like P systems ⋮ P systems with evolutional symport and membrane creation rules solving QSAT ⋮ A Linear–time Tissue P System Based Solution for the 3–coloring Problem

This page was built for publication: Membrane Computing