Publication:3601857
From MaRDI portal
zbMath1154.68053MaRDI QIDQ3601857
Mario J. Pérez-Jiménez, Giancarlo Mauri, Claudio Ferretti, Alberto Leporati, Claudio Zandron
Publication date: 12 February 2009
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
A $\Sigma_2^P \cup \Pi_2^P$ Lower Bound Using Mobile Membranes, A toolbox for simpler active membrane algorithms, A Turing machine simulation by P systems without charges, Shallow laconic P-systems can count, P systems attacking hard problems beyond NP: a survey, Cell-like P systems with polarizations and minimal rules, Monodirectional P systems, A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division, Selected Topics in Computational Complexity of Membrane Systems