P Systems with Proteins on Membranes and Membrane Division

DOI10.1007/11779148_27zbMath1227.68027OpenAlexW1812191360MaRDI QIDQ3617067

Andrei Păun, Bianca Popa

Publication date: 26 March 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11779148_27

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

An efficient time-free solution to SAT problem by P systems with proteins on membranes, An efficient time-free solution to QSAT problem using P systems with proteins on membranes, P systems with proteins on membranes characterize PSPACE, Self-healing Turing-universal computation in morphogenetic systems, Morphogenetic computing: computability and complexity results, Computing with cells: membrane systems – some complexity issues, The computational power of cell-like P systems with one protein on membrane, Membrane computing and brane calculi. Old, new, and future bridges, Decision problems in membrane systems with peripheral proteins, transport and evolution, (Mem)brane automata, P systems with proteins: a new frontier when membrane division disappears, P systems attacking hard problems beyond NP: a survey, Sequentiality Induced by Spike Number in SNP Systems, Membrane Systems with Peripheral Proteins: Transport and Evolution, Computational universality and efficiency in morphogenetic systems