Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques

DOI10.1007/978-3-319-14370-5_13zbMath1457.68097OpenAlexW150024694MaRDI QIDQ3454891

Miguel Á. Gutiérrez-Naranjo, Zsolt Gazdag

Publication date: 2 December 2015

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/33500

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (3)

On the power of membrane dissolution in polarizationless P systems with active membranes ⋮ Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes ⋮ A new method to simulate restricted variants of polarizationless P systems with active membranes

This page was built for publication: Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques