P Systems with Active Membranes Characterize PSPACE

DOI10.1007/11925903_3MaRDI QIDQ5452559zbMATH OpenOpenAlexFDO

Authors Petr Sosík, Alfonso Rodríguez-Patón

Publication date 4 April 2008

Published in DNA Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Membrane computing and complexity theory: A characterization of PSPACE
• P systems with proteins on membranes characterize PSPACE
• P systems with active membranes working in polynomial space
• P systems with active membranes: Attacking NP-complete problems
• Recent complexity-theoretic results on P systems with active membranes

Cited in

(11)

• The computational power of cell division in P systems: Beating down parallel computers?
• P systems based computing polynomials: design and formal verification
• A view of P systems from information theory
• P systems with active membranes working in polynomial space
• P Systems with Active Membranes Working in Sublinear Space
• A Biologically Inspired Model with Fusion and Clonation of Membranes
• P systems with proteins on membranes characterize PSPACE
• Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
• scientific article; zbMATH DE number 6665229 (Why is no real title available?)
• Membrane Computing
• Membrane computing and complexity theory: A characterization of PSPACE

This page was built for publication: P Systems with Active Membranes Characterize PSPACE

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