Recent complexity-theoretic results on P systems with active membranes
DOI10.1093/LOGCOM/EXS077zbMATH Open1347.68141DBLPjournals/logcom/MauriLPZ15OpenAlexW2158698472WikidataQ57518504 ScholiaQ57518504MaRDI QIDQ3465046FDOQ3465046
Authors: Giancarlo Mauri, Alberto Leporati, Antonio E. Porreca, Claudio Zandron 
Publication date: 28 January 2016
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exs077
Recommendations
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (16)
- Membrane computing and complexity theory: A characterization of PSPACE
- Time and space complexity of P systems -- and why they matter
- Characterizing PSPACE with shallow non-confluent P systems
- Proof techniques in membrane computing
- Kernel P systems: from modelling to verification and testing
- Subroutines in P systems and closure properties of their complexity classes
- Asynchronous P systems with active membranes
- Computational complexity aspects in membrane computing
- Exploiting membrane features to compute
- P systems with active membranes operating under minimal parallelism
- P Systems with Active Membranes Characterize PSPACE
- Complexity classes for membrane systems: a survey
- Computational complexity of P systems with active membranes
- Complexity classes for membrane systems
- Title not available (Why is that?)
- Active membranes, proteins on membranes, tissue P systems: complexity-related issues and challenges
This page was built for publication: Recent complexity-theoretic results on P systems with active membranes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465046)
