scientific article; zbMATH DE number 5054901
From MaRDI portal
Publication:5487108
zbMath1099.68031MaRDI QIDQ5487108
Publication date: 18 September 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
An efficient time-free solution to SAT problem by P systems with proteins on membranes ⋮ P systems with protein rules ⋮ Probabilistic Guarded P Systems, A New Formal Modelling Framework ⋮ An efficient time-free solution to QSAT problem using P systems with proteins on membranes ⋮ On the verification of membrane systems with dynamic structure ⋮ P systems with proteins on membranes characterize PSPACE ⋮ The computational power of enzymatic numerical P systems working in the sequential mode ⋮ Self-healing Turing-universal computation in morphogenetic systems ⋮ Morphogenetic computing: computability and complexity results ⋮ Computational Power of Protein Networks ⋮ The computational power of cell-like P systems with one protein on membrane ⋮ From P systems to morphogenetic systems: an overview and open problems ⋮ Selected Topics in Computational Complexity of Membrane Systems ⋮ Membrane computing and brane calculi. Old, new, and future bridges ⋮ (Mem)brane automata ⋮ Cell Cycle and Tumor Growth in Membrane Systems with Peripheral Proteins ⋮ Sequential SNP systems based on min/max spike number ⋮ Membrane computing with transport and embedded proteins ⋮ P systems attacking hard problems beyond NP: a survey ⋮ Morphogenetic systems for resource bounded computation and modeling ⋮ Sequentiality Induced by Spike Number in SNP Systems ⋮ Solving the 3-COL problem by using tissue P systems without environment and proteins on cells ⋮ Membrane Computing and Brane Calculi (Some Personal Notes) ⋮ Computational universality and efficiency in morphogenetic systems
This page was built for publication:
