Membrane Computing
From MaRDI portal
Publication:5901894
DOI10.1007/b95207zbMath1202.68198OpenAlexW2282613654MaRDI QIDQ5901894
Mario J. Pérez-Jiménez, Agustín Riscos-Núñez
Publication date: 15 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95207
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (11)
Formal Verification of P Systems with Active Membranes through Model Checking ⋮ Complexity aspects of polarizationless membrane systems ⋮ A uniform solution to SAT using membrane creation ⋮ On the computational complexity of membrane systems ⋮ Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ Formal verification of cP systems using PAT3 and ProB ⋮ Seeking computational efficiency boundaries: the Păun's conjecture ⋮ Solving the subset-problem by P systems with active membrans ⋮ A Logarithmic Bound for Solving Subset Sum with P Systems ⋮ A fast \(P\) system for finding a balanced 2-partition
This page was built for publication: Membrane Computing
