Simulating counting oracles with cooperation

DOI10.1007/S41965-020-00052-0zbMath1469.68044OpenAlexW3108409253MaRDI QIDQ1982984

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

Publication date: 14 September 2021

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

Full work available at URL: https://doi.org/10.1007/s41965-020-00052-0

zbMATH Keywords

minimal cooperationchargeless P-systemscounting oraclesmonodirectional P-systemsP-systems with active membranes

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (1)

Depth-two P systems can simulate Turing machines with \textbf{NP} oracles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational power of membrane systems under tight uniformity conditions
• Membrane computing and complexity theory: A characterization of PSPACE
• Tissue P systems.
• Computing with membranes
• The counting power of P systems with antimatter
• A guide to membrane computing.
• Membrane computing. An introduction.
• Subroutines in P systems and closure properties of their complexity classes
• Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
• P systems attacking hard problems beyond NP: a survey
• Monodirectional P systems
• Characterising the complexity of tissue P systems with fission rules
• A path to computational efficiency through membrane computing
• Membrane Division, Oracles, and the Counting Hierarchy
• Polarizationless P Systems with Active Membranes: Computational Complexity Aspects
• Simulating Elementary Active Membranes

This page was built for publication: Simulating counting oracles with cooperation