A $\Sigma_2^P \cup \Pi_2^P$ Lower Bound Using Mobile Membranes

DOI10.1007/978-3-642-22600-7_22zbMath1341.68049OpenAlexW2104960854WikidataQ57936723 ScholiaQ57936723MaRDI QIDQ5200098

Shankara Narayanan Krishna, Gabriel Ciobanu

Publication date: 29 July 2011

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22600-7_22

Mathematics Subject Classification ID

Related Items (1)

Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhanced mobile membranes: computability results
• Trading polarizations for labels in P systems with active membranes
• Complexity classes in models of cellular computing with membranes
• Computing with membranes
• Further remarks on \(P\) systems with active membranes, separation, merging, and release rules
• Complexity aspects of polarizationless membrane systems
• P Systems with Elementary Active Membranes: Beyond NP and coNP
• On the Computational Power of Enhanced Mobile Membranes
• On Relating Time and Space to Size and Depth
• Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes

This page was built for publication: A $\Sigma_2^P \cup \Pi_2^P$ Lower Bound Using Mobile Membranes