Solving the ST-connectivity problem with pure membrane computing techniques

DOI10.1007/978-3-319-14370-5_13MaRDI QIDQ3454891zbMATH OpenOpenAlexFDO

Authors Zsolt Gazdag, Miguel A. Gutiérrez-Naranjo

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

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

Recommendations

• Complexity classes in models of cellular computing with membranes
• Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
• P Systems with Elementary Active Membranes: Beyond NP and coNP
• scientific article; zbMATH DE number 2118901
• Counting membrane systems

Cited in

(3)

• A new method to simulate restricted variants of polarizationless P systems with active membranes
• Remarks on the computational power of some restricted variants of P systems with active membranes
• On the power of membrane dissolution in polarizationless P systems with active membranes

This page was built for publication: Solving the ST-connectivity problem with pure membrane computing techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454891)