P Systems with Elementary Active Membranes: Beyond NP and coNP

DOI10.1007/978-3-642-18123-8_26zbMath1259.68064OpenAlexW1594958418MaRDI QIDQ3067497

Antonio E. Porreca, Alberto Leporati, Claudio Zandron, Giancarlo Mauri

Publication date: 21 January 2011

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18123-8_26

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (9)

P Systems with Active Membranes Operating under Minimal Parallelism ⋮ Asynchronous P systems with active membranes ⋮ Evaluating space measures in P systems ⋮ Bounding the space in P systems with active membranes ⋮ Seeking computational efficiency boundaries: the Păun's conjecture ⋮ 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 ⋮ P systems with evolutional symport and membrane creation rules solving QSAT

This page was built for publication: P Systems with Elementary Active Membranes: Beyond NP and coNP