A Computational Complexity Theory in Membrane Computing
From MaRDI portal
Publication:5851902
DOI10.1007/978-3-642-11467-0_10zbMath1273.68185OpenAlexW1542878110MaRDI QIDQ5851902
Publication date: 26 January 2010
Published in: Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11467-0_10
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (17)
Variants of Distributed P Automata and the Efficient Parallelizability of Languages ⋮ From distribution to replication in cooperative systems with active membranes: a frontier of the efficiency ⋮ P systems with proteins on membranes characterize PSPACE ⋮ P colonies with agent division ⋮ Solving 3-SAT in distributed P systems with string objects ⋮ Solution to Motif Finding Problem in Membranes ⋮ Simple Neural-Like P Systems for Maximal Independent Set Selection ⋮ A limitation of cell division in tissue P systems by PSPACE ⋮ On solutions and representations of spiking neural P systems with rules on synapses ⋮ Bounding the space in P systems with active membranes ⋮ A survey of results on evolution-communication P systems with energy ⋮ Selected Topics in Computational Complexity of Membrane Systems ⋮ On the Parallelizability of Languages Accepted by P Automata ⋮ A quick introduction to membrane computing ⋮ When object production tunes the efficiency of membrane systems ⋮ P systems attacking hard problems beyond NP: a survey ⋮ Deciding According to the Shortest Computations
This page was built for publication: A Computational Complexity Theory in Membrane Computing
