Symport/antiport P systems with membrane separation characterize P\textsuperscript{(\#P)}

DOI10.1007/978-3-032-15641-9_12MaRDI QIDQ7348929zbMATH OpenFDO

Authors Vivien Ducros, Claudio Zandron

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-15641-9_12

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• A computational complexity theory in membrane computing
• A P-Lingua based simulator for P systems with symport/antiport rules
• Characterising the complexity of tissue P systems with fission rules
• Computing with membranes
• scientific article; zbMATH DE number 5671765 (Why is no real title available?)
• P systems attacking hard problems beyond NP: a survey
• P systems with active membranes: Attacking NP-complete problems
• P systems with symport/antiport rules: when do the surroundings matter?
• Simple characterizations of \(P(\# P)\) and complete problems
• The power of communication: P systems with symport/antiport

This page was built for publication: Symport/antiport P systems with membrane separation characterize P\textsuperscript{(\#P)}

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