scientific article
From MaRDI portal
Publication:3601857
zbMath1154.68053MaRDI QIDQ3601857
Mario J. Pérez-Jiménez, Giancarlo Mauri, Claudio Ferretti, Alberto Leporati, Claudio Zandron
Publication date: 12 February 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
A Turing machine simulation by P systems without charges ⋮ Shallow laconic P-systems can count ⋮ Selected Topics in Computational Complexity of Membrane Systems ⋮ A toolbox for simpler active membrane algorithms ⋮ A $\Sigma_2^P \cup \Pi_2^P$ Lower Bound Using Mobile Membranes ⋮ 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
This page was built for publication:
