Simulating counting oracles with cooperation
DOI10.1007/S41965-020-00052-0zbMATH Open1469.68044OpenAlexW3108409253MaRDI QIDQ1982984FDOQ1982984
Authors: Alberto Leporati, Luca Manzoni, Antonio E. Porreca, Claudio Zandron, 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
Recommendations
minimal cooperationchargeless P-systemscounting oraclesmonodirectional P-systemsP-systems with active membranes
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Computing with membranes
- Membrane computing. An introduction.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tissue P systems.
- Spiking neural P systems
- A guide to membrane computing.
- P systems with active membranes: Attacking NP-complete problems
- Membrane computing and complexity theory: A characterization of PSPACE
- Title not available (Why is that?)
- The computational power of membrane systems under tight uniformity conditions
- Title not available (Why is that?)
- Membrane division, oracles, and the counting hierarchy
- Simulating elementary active membranes
- Characterising the complexity of tissue P systems with fission rules
- Polarizationless P systems with active membranes: computational complexity aspects
- Subroutines in P systems and closure properties of their complexity classes
- A path to computational efficiency through membrane computing
- The counting power of P systems with antimatter
- Monodirectional P systems
- Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
- P systems attacking hard problems beyond NP: a survey
Cited In (6)
- Shallow laconic P-systems can count
- Membrane division, oracles, and the counting hierarchy
- The counting power of P systems with antimatter
- Tissue P systems can be simulated efficiently with counting oracles
- Depth-two P systems can simulate Turing machines with \textbf{NP} oracles
- P systems simulating oracle computations
This page was built for publication: Simulating counting oracles with cooperation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982984)
